Complexity in Convex Languages

A language L is prefix-convex if, whenever words u and w are in L with u a prefix of w, then every word v which has u as a prefix and is a prefix of w is also in L. Similarly, we define suffix-, factor-, and subword-convex languages, where by subword we mean subsequence. Together, these languages constitute the class of convex languages which contains interesting subclasses, such as ideals, closed languages (including factorial languages) and free languages (including prefix-, suffix-, and infix-codes, and hypercodes). There are several advantages of studying the class of convex languages and its subclasses together. These classes are all definable by binary relations, in fact, by partial orders. Closure properties of convex languages have been studied in this general framework of binary relations. The problems of deciding whether a language is convex of a particular type have been analyzed together, and have been solved by similar methods. The state complexities of regular operations in subclasses of convex languages have been examined together, with considerable economies of effort. This paper surveys the recent results on convex languages with an emphasis on complexity issues.

[1]  Y. O. Hamidoune,et al.  The Diophantine Frobenius Problem , 2006 .

[2]  Sheng Yu,et al.  The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[3]  Gabriel Thierrin Convex Languages , 1972, ICALP.

[4]  Janusz A. Brzozowski,et al.  Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages , 2010, ArXiv.

[5]  Dominique Perrin,et al.  Codes and Automata (Encyclopedia of Mathematics and its Applications) , 2009 .

[6]  Janusz A. Brzozowski,et al.  Languages Convex with Respect to Binary Relations, and Their Closure Properties , 2009, Acta Cybern..

[7]  Joseph B. Kruskal,et al.  The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.

[8]  Narad Rampersad,et al.  On NFAs where all states are final, initial, or both , 2008, Theor. Comput. Sci..

[9]  Lawrence T. Kou,et al.  Multiple-Entry Finite Automata , 1974, J. Comput. Syst. Sci..

[10]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[11]  R. M. Capocelli Sequences: combinatorics, compression, security, and transmission , 1990 .

[12]  Umberto Eco,et al.  Theory of Codes , 1976 .

[13]  L. H. Haines On free monoids partially ordered by embedding , 1969 .

[14]  Bezalel Peleg,et al.  Ultimate-Definite and Symmetric-Definite Events and Automata , 1965, JACM.

[15]  Zhi Xu,et al.  Decision problems for convex languages , 2008, Inf. Comput..

[16]  A. Luca,et al.  Some combinatorial properties of factorial languages , 1990 .

[17]  Wojciech Rytter,et al.  On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[18]  Dominique Perrin,et al.  Codes and Automata , 2009, Encyclopedia of mathematics and its applications.

[19]  H. Shyr Free monoids and languages , 1979 .

[20]  Gerhard J. Woeginger,et al.  Automata, Languages and Programming , 2003, Lecture Notes in Computer Science.

[21]  Derick Wood,et al.  Operational State Complexity of Prefix-Free Regular Languages , 2009, Automata, Formal Languages, and Related Topics.

[22]  Janusz A. Brzozowski,et al.  Quotient Complexity of Ideal Languages , 2010, LATIN.

[23]  Helmut Jürgensen,et al.  Relations on free monoids, their independent sets, and codes , 1991, Int. J. Comput. Math..

[24]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[25]  Huei-Jan Shyr,et al.  Hypercodes , 1974, Inf. Control..

[26]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[27]  Karel Culik,et al.  State Complexity of Basic Operations on Finite Languages , 1999, WIA.

[28]  Janusz Brzozowski,et al.  Quotient Complexity of Regular Languages , 2009, J. Autom. Lang. Comb..

[29]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[30]  Sheng Yu,et al.  State Complexity of Regular Languages , 2001, J. Autom. Lang. Comb..

[31]  Yo-Sub Han,et al.  State Complexity of Basic Operations on Suffix-Free Regular Languages , 2007, MFCS.