Combinatorics of Words

This is a survey on combinatorics of words to appear as a chapter in Handbook of Formal Languages. The topics covered in details are: defect effect, equations as properties of words, periodicity, finiteness conditions, avoidabilty and subword complexity.

[1]  Antonio Restivo,et al.  A Periodicity Theorem on Words and Applications , 1995, MFCS.

[2]  Wojciech Plandowski,et al.  Compactness of Systems of Equations in Semigroups , 1997, Int. J. Algebra Comput..

[3]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[4]  Wojciech Plandowski,et al.  Polynomial Size Test Sets for Context-Free Languages , 1992, ICALP.

[5]  Leszek Pacholski,et al.  Complexity of Makanin's algorithm , 1996, JACM.

[6]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[7]  Jean Néraud.  Deciding Whether a Finite Set of Words has Rank at Most Two , 1993, Theor. Comput. Sci..

[8]  Filippo Mignosi,et al.  On the Number of Factors of Sturmian Words , 1991, Theor. Comput. Sci..

[9]  Maurice Pouzet,et al.  Une caracterisation des mots periodiques , 1979, Discret. Math..

[10]  Jean Berstel,et al.  Some Recent Results on Squarefree Words , 1984, STACS.

[11]  Juhani Karhumäki,et al.  The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids , 1984, Theor. Comput. Sci..

[12]  Michel Koskas.  Complexity of Toeplitz sequences. , 1998 .

[13]  John Michael Robson.  Separating Strings with Small Automata , 1989, Inf. Process. Lett..

[14]  Tero Harju,et al.  Remarks on Generalized Post Correspondence Problem , 1996, STACS.

[15]  Dominique Gouyou-Beauchamps,et al.  Sur les Facteurs des Suites de Sturm , 1990, Theor. Comput. Sci..

[16]  Martin D. Davis.  Hilbert's Tenth Problem is Unsolvable , 1973 .

[17]  Jean Pierre Duval,et al.  Factorizing Words over an Ordered Alphabet , 1983, J. Algorithms.

[18]  J. R. Büchi,et al.  Coding in the Existential Theory of Concatenation , 1987 .

[19]  Andrzej Ehrenfeucht,et al.  Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions , 1975, Theor. Comput. Sci..

[20]  Aldo de Luca,et al.  Sturmian Words, Lyndon Words and Trees , 1997, Theor. Comput. Sci..

[21]  Michael H. Albert,et al.  A Proof of Ehrenfeucht's Conjecture , 1985, Theor. Comput. Sci..

[22]  Maxime Crochemore,et al.  Sharp Characterizations of Squarefree Morphisms , 1982, Theor. Comput. Sci..

[23]  Jean-Pierre Duval,et al.  Periodes et Repetitions des Mots du Monoide Libre , 1979, Theor. Comput. Sci..

[24]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[25]  Jean Berstel,et al.  Average Cost of Duval's Algorithm for Generating Lyndon Words , 1994, Theor. Comput. Sci..

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

[27]  Wojciech Rytter,et al.  Efficient constructions of test sets for regular and context-free languages , 1991, Theor. Comput. Sci..

[28]  K. A. Baker,et al.  Growth Problems for Avoidable Words , 1989, Theor. Comput. Sci..

[29]  G. Rauzy,et al.  Mots infinis en arithmétique , 1984, Automata on Infinite Words.

[30]  Veikko Keränen.  On the k-Freeness of Morphisms on Free Monoids , 1987, STACS.

[31]  Raj Pal Soni,et al.  Aperiodic words on three symbols. III. , 1982 .

[32]  Arto Salomaa.  The Ehrenfeucht conjecture: a proof for language theorists , 1985, Bull. EATCS.

[33]  F. Michel Dekking,et al.  Strongly Non-Repetitive Sequences and Progression-Free Sets , 1979, J. Comb. Theory, Ser. A.

[34]  Christian Choffrut.  Bijective Sequential Mappings of a Free Monoid Onto Another , 1994, RAIRO Theor. Informatics Appl..

[35]  Dwight R. Bean,et al.  Avoidable patterns in strings of symbols , 1979 .

[36]  Andrzej Ehrenfeucht,et al.  On the Subword Complexity of D0L Languages with a Constant Distribution , 1981, Inf. Process. Lett..

[37]  J. Richard Büchi,et al.  Coding in the existential theory of concatenation , 1987, Arch. Math. Log..

[38]  Jean Néraud.  On the Rank of the Subsets of a Free Monoid , 1992, Theor. Comput. Sci..

[39]  Arturo Carpi,et al.  Overlap-Free Words and Finite Automata , 1993, Theor. Comput. Sci..

[40]  Juhani Karhumäki,et al.  Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms , 1997, Eur. J. Comb..

[41]  Robert Cori,et al.  On the Number of Partially Abelian Square-Free Words on a Three-Letter Alphabet , 1991, Theor. Comput. Sci..

[42]  Antonio Restivo,et al.  Overlap-free words on two symbols , 1984, Automata on Infinite Words.

[43]  Jean-Jacques Pansiot.  A propos d'une conjecture de F. Dejean sur les répétitions dans les mots , 1984, Discret. Appl. Math..

[44]  J. Berstel,et al.  Sur le théorème du défaut , 1979 .

[45]  Tom C. Brown,et al.  Descriptions of the Characteristic Sequence of an Irrational , 1993, Canadian Mathematical Bulletin.

[46]  Juhani Karhumäki.  A note on intersections of free submonoids of a free monoid , 1984 .

[47]  David Haussler,et al.  On Regularity of Context-Free Languages , 1983, Theor. Comput. Sci..

[48]  M. Schützenberger,et al.  The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[49]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[50]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[51]  J. Nielsen,et al.  Die Isomorphismengruppe der freien Gruppen , 1924 .

[52]  Jean-Jacques Pansiot,et al.  Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés , 1984, ICALP.

[53]  M. H. Albert,et al.  The descending chain condition on solution sets for systems of equations in groups , 1986 .

[54]  Grzegorz Rozenberg,et al.  Cornerstones of undecidability , 1994, Prentice Hall International Series in Computer Science.

[55]  Laurent Rosaz,et al.  Unavoidable Languages, Cuts and Innocent Sets of Words , 1995, RAIRO Theor. Informatics Appl..

[56]  A. Zimin.  BLOCKING SETS OF TERMS , 1984 .

[57]  Michel Koskas,et al.  Complexités de suites de Toeplitz , 1998, Discret. Math..

[58]  Yuji Kobayashi,et al.  Enumeration of irreducible binary words , 1988, Discret. Appl. Math..

[59]  Mark V. Sapir.  Combinatorics on Words with Applications , 1998 .

[60]  Tero Harju,et al.  On the Periodicity of Morphisms on Free Monoids , 1986, RAIRO Theor. Informatics Appl..

[61]  Jean Berstel,et al.  Sur les mots sans carré définis par un morphisme , 1979, ICALP.

[62]  Habib Abdulrab,et al.  Equations in Words , 1988, ISSAC.

[63]  Jean-Jacques Pansiot,et al.  Decidability of Periodicity for Infinite Words , 1986, RAIRO Theor. Informatics Appl..

[64]  Françoise Dejean,et al.  Sur un Théorème de Thue , 1972, J. Comb. Theory A.

[65]  A. Lentin.  Équations dans les monoïdes libres , 1972 .

[66]  Karel Culik,et al.  Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid , 1982, Inf. Control..

[67]  Patrice Séébold.  Sequences generated by infinitely iterated morphisms , 1985, Discret. Appl. Math..

[68]  N. Sloane.  A Handbook Of Integer Sequences , 1973 .

[69]  Sebastian Seibert.  Quantifier Hierarchies over Word Relations , 1991, CSL.

[70]  J. Howard Johnson.  Rational Equivalence Relations , 1986, Theor. Comput. Sci..

[71]  Jean Berstel,et al.  Mots sans carre et morphismes iteres , 1980, Discret. Math..

[72]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[73]  Karel Culik,et al.  Systems of equations over a free monoid and Ehrenfeucht's conjecture , 1983, Discret. Math..

[74]  Jean Berstel,et al.  A Rewriting of Fife's Theorem about Overlap-Free Words , 1994, Results and Trends in Theoretical Computer Science.

[75]  J Justin.  Characterization of the repetitive commutative semigroups , 1972 .

[76]  Juhani Karhumäki,et al.  On cube-free ω-words generated by binary morphisms , 1983, Discret. Appl. Math..

[77]  Julien Cassaigne.  Motifs evitables et regularites dans les mots , 1994 .

[78]  Michel Leconte,et al.  A Characterization of Power-Free Morphisms , 1985, Theor. Comput. Sci..

[79]  Jean Néraud.  Elementariness of a finite set of words is co-NP-complete , 1990, RAIRO Theor. Informatics Appl..

[80]  Franz-Josef Brandenburg,et al.  Uniformly Growing k-TH Power-Free Homomorphisms , 1988, Theor. Comput. Sci..

[81]  Julien Cassaigne,et al.  Counting Overlap-Free Binary Words , 1993, STACS.

[82]  Wojciech Plandowski,et al.  On the Size of Independent Systems of Equations in Semigroups , 1996, Theor. Comput. Sci..

[83]  R. Tennant.  Algebra , 1941, Nature.

[84]  V. Koubek,et al.  On Discerning Words by Automata , 1986, ICALP.

[85]  Andrzej Ehrenfeucht,et al.  The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable , 1982, Theor. Comput. Sci..

[86]  Aldo de Luca,et al.  Sturmian Words: Structure, Combinatorics, and Their Arithmetics , 1997, Theor. Comput. Sci..

[87]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[88]  J. Howard Johnson.  Rational Equivalence Relations , 1986, ICALP.

[89]  J. C. Spehner.  Quelques Constructions Et Algorithmes Relatifs Aux Sous-Monoïdes D'un Monoïde Libre , 1974 .

[90]  Juhani Karhumäki.  A Note on Intersections of Free Submonoids of a Free Monoid , 1983, ICALP.

[91]  Jean Moulin Ollagnier,et al.  Proof of Dejean's Conjecture for Alphabets with 5, 6, 7, 8, 9, 10 and 11 Letters , 1992, Theor. Comput. Sci..

[92]  Jan Brinkhuis,et al.  NON-REPETITIVE SEQUENCES ON THREE SYMBOLS , 1983 .

[93]  Jean-Paul Allouche,et al.  Sur la complexite des suites in nies , 1994 .

[94]  Filippo Mignosi,et al.  Some Combinatorial Properties of Sturmian Words , 1994, Theor. Comput. Sci..

[95]  Karel Culik,et al.  On the Equality Sets for Homomorphisms on Free Monoids with Two Generators , 1980, RAIRO Theor. Informatics Appl..

[96]  Ursula Martin,et al.  A Note on Division Orderings on Strings , 1990, Inf. Process. Lett..

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

[98]  Andrzej Ehrenfeucht,et al.  Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem , 1978, Theor. Comput. Sci..

[99]  Xerox Polo,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976 .

[100]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[101]  Andrzej Ehrenfeucht,et al.  On binary equality sets and a solution to the test set conjecture in the binary case , 1983 .

[102]  S. Ginsburg,et al.  A Characterization of Machine Mappings , 1966, Canadian Journal of Mathematics.

[103]  Jean Berstel,et al.  Properties of Infinite Words: Recent Result , 1989, STACS.

[104]  Wojciech Plandowski,et al.  Polynomial Size Test Sets for Context-Free Languages , 1995, J. Comput. Syst. Sci..

[105]  Leonidas J. Guibas,et al.  Periods in Strings , 1981, J. Comb. Theory, Ser. A.

[106]  Harold Marston Morse.  Recurrent geodesics on a surface of negative curvature , 1921 .

[107]  Filippo Mignosi,et al.  Repetitions in the Fibonacci infinite word , 1992, RAIRO Theor. Informatics Appl..

[108]  P. Pleasants.  Non-repetitive sequences , 1970, Mathematical Proceedings of the Cambridge Philosophical Society.

[109]  Juhani Karhumäki,et al.  Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract) , 1995, COCOON.

[110]  Andrzej Ehrenfeucht,et al.  On the Subword Complexity of m-Free D0L Languages , 1983, Inf. Process. Lett..

[111]  Robert Shelton.  Aperiodic words on three symbols. , 1981 .

[112]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[113]  Arto Lepistö.  Repetitions in Kolakoski Sequence , 1993, Developments in Language Theory.

[114]  Eric Domenjoud,et al.  Solving Systems of Linear Diophantine Equations: An Algebraic Approach , 1991, MFCS.

[115]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[116]  Tero Harju,et al.  ON CYCLICALLY OVERLAP-FREE WORDS IN BINARY ALPHABETS , 1986 .

[117]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[119]  Habib Abdulrab.  Implementation of Makanin's Algorithm , 1990, IWWERT.

[120]  Juhani Karhumäki,et al.  Alternating Iteration of Morphisms and the Kolakovski Sequence , 1992 .

[121]  G. Lallement.  Semigroups and combinatorial applications , 1979 .

[122]  Jean-Pierre Pécuchet.  Solutions principales et rang d'un système d'équations avec constantes dans le monoïde libre , 1984, Discret. Math..

[123]  Earl D. Fife.  Binary sequences which contain no $BBb$ , 1980 .

[124]  Wojciech Plandowski,et al.  Compactness of Systems of Equations in Semigroups , 1995, Int. J. Algebra Comput..

[125]  Jean Berstel,et al.  Axel Thue's work on repetitions in words , 1992 .

[126]  J. Berstel,et al.  Theory of codes , 1985 .

[127]  Habib Abdulrab.  Résolution d'équations sur les mots : étude et implémentation Lisp de l'algorithme de Makanin , 1987 .

[128]  Andrzej Ehrenfeucht,et al.  On the Subword Complexity of Locally Catenative D0L Languages , 1983, Inf. Process. Lett..

[129]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[130]  Tero Harju,et al.  On the defect theorem and simplifiability , 1986 .

[131]  Ursula Schmidt,et al.  Avoidable Patterns on Two Letters , 1989, Theor. Comput. Sci..

[132]  Andrzej Ehrenfeucht,et al.  On the Subword Complexity of Square-Free D0L Languages , 1981, Theor. Comput. Sci..

[133]  Iu I Khmelevskiĭ.  Equations in free semigroups , 1976 .

[134]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[135]  Robert Shelton.  Aperiodic words on three symbols. II. , 1981 .

[136]  Dominique Perrin.  On the solution of Ehrenfeucht's conjecture , 1985, Bull. EATCS.

[137]  S. Dulucq,et al.  On the factors of the Sturmian sequences , 1990 .

[138]  Christian Choffrut,et al.  On extendibility of unavoidable sets , 1984, Discret. Appl. Math..

[139]  John Michael Robson.  Separating Words with Machines and Groups , 1996, RAIRO Theor. Informatics Appl..

[140]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[141]  Wojciech Plandowski,et al.  On the Size of Independent Systems of Equations in Semigroups , 1994, MFCS.

[142]  Veikko Keränen,et al.  Abelian Squares are Avoidable on 4 Letters , 1992, ICALP.

[143]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[144]  J. Berstel.  Axel Thue''s papers on repetitions in words: a translation. In: Publications du LaCIM, vol. 20. U , 1992 .

[145]  Maxime Crochemore,et al.  Two-way string-matching , 1991, JACM.

[146]  Pavel Goralcik,et al.  Binary Patterns in Binary Words , 1991, Int. J. Algebra Comput..

[147]  Arto Salomaa,et al.  On Infinite Words Obtained by Iterating Morphisms , 1982, Theor. Comput. Sci..

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

[149]  Wojciech Rytter,et al.  Text Algorithms , 1994 .