Automata on Words

[1]  M. Lothaire,et al.  Algebraic Combinatorics on Words: Index of Notation , 2002 .

[2]  J. Karhumäki,et al.  Locally Periodic Versus Globally Periodic Infinite Words , 2002, J. Comb. Theory, Ser. A.

[3]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

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

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

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

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

[8]  Antonio Restivo,et al.  Periodicity and the Golden Ratio , 1998, Theor. Comput. Sci..

[9]  Petr Hájek,et al.  Mathematical Foundations of Computer Science 1995 , 1995, Lecture Notes in Computer Science.

[10]  Wojciech Plandowski,et al.  Locally Periodic Infinite Words and a Chaotic Behaviour , 1998, ICALP.

[11]  M. Lothaire,et al.  Combinatorics on words: Frontmatter , 1997 .

[12]  Antonio Restivo,et al.  Some Applications of a Theorem of Shirshov to Language Theory , 1983, Inf. Control..

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

[14]  Christian Choffrut,et al.  Combinatorics of Words , 1997, Handbook of Formal Languages.

[15]  Juhani Karhumäki,et al.  On the Undecidability of Freeness of Matrix Semigroups , 1999, Int. J. Algebra Comput..

[16]  Tero Harju,et al.  A Note on Decidability Questions on Presentations of Word Semigroups , 1997, Theor. Comput. Sci..

[17]  Juhani Karhumäki,et al.  Applications of Finite Automata , 2002, MFCS.

[18]  Aldo de Luca,et al.  Finiteness and Regularity in Semigroups and Formal Languages , 1999, Monographs in Theoretical Computer Science An EATCS Series.

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

[20]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .