Summary
We consider several problems of infinite words over a finite alphabet. In particular, we describe a few automata-theoretic methods to define infinite words. Properties of infinite words studied in more details are repetition-freeness, periodicity and different kinds of complexity issues. Examples are used to illustrate the power of infinite words in many applications, as well as illustrations of problems from different areas of mathematics.
Supported by the Academy of Finland under the grant 44087
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.I. Adian, The Burnside Problem and Identities in Groups, Springer-Verlag, 1979.
M.H. Albert and J. Lawrence, A proof of Ehrenfeucht’s conjecture, Theoret. Comput. Sci. 41, 121–123, 1985.
S.E. Argon, Proof of the existence on n-valued infinite asymmetric sequences, Mat. Sb. 2 (44), 769–779, 1937.
D.R. Bean, A. Ehrenfeucht, and G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math. 85, 261–294, 1979.
J. Berstel, Transductions and Context-Free Languages, Teubner, 1979.
J. Berstel and J. Karhumäki, Combiantorics on Words — A Tutorial, Bull. EATCS 79, 178–228, 2003.
F.-J. Brandenburg, Uniformly growing k-th power-free homomorphisms, Theoret. Comput. Sci. 23, 69–82, 1983.
C. Choffrut and J. Karhumäki, Combinatorics of words, In: A. Salomaa and G. Rozenberg (eds.), Handbook of Formal Languages, Vol. 1, 329–438. Springer-Verlag, 1997.
K. Culik II and J. Karhumäki, Iterative devices generating infinite words, Int. J. Found. Comput. Sci. 5, 69–97, 1994.
F. Dejean, Sur un théorème de Thue, J. Combin. Th. A 13, 90–99, 1972.
P. burg and J. Manuch, On the computational complexity of infinite words, Theoret. Comput. Sci. 1–3, 141–151, 2003.
A. Ehrenfeucht, K. P. Lee, and G. Rozenberg, Subword complexities of various classes of deterministic developmental languages without interaction, Theoret. Comput. Sci. 1, 59–75, 1975.
S. Ferenczi and C. Mauduit, Transcendence of numbers with a low complexity expansion, J. Number Theory 67, 146–161, 1997.
J.E. Hoperoft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
J. Hromkovié, J. Karhumäki, and A. Lepistö, Comparing descriptional and computational complexity of infinite words, In: J. Karhumäki, H. Maurer, and G. Rozenberg (Eds.), Results and Trends in Theoretical Computer Science, LNCS 812, 169–182, Springer-Verlag, 1994.
C.F. Gauss, Werke,Teubner, Leibzig, 1900 (pp. 272 and 282–286).
V.S. Guba, The equivalence of infinite systems of equations in free groups and semigroups to their finite subsystems, Math. Zametki 40, 321–324, 1986.
J. Karhumäki, A. Lepistö, and W. Plandowski, Locally periodic infinite words and a chaotic behaviour, J. Comb. Theor., Ser. A 100, 250–264, 2002.
J. Karhumäki and J. Manuch, in preparation.
J. Karhumäki and J. Shallit, Polynomial versus exponential growth in repetition-free binary words, manuscript, 12pp, 2003.
A. Lepistö, On the power of periodic iteration of morphisms, LNCS 700, 496–506, 1993.
A. Lepistö, On Relations between Local and Global Periodicity, Ph.D. Thesis, University of Turku, TUCS Dissertations 43, 2002.
M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics 17, Addison-Wesley, 1983. Reprinted in the Cambridge Mathematical Library, Cambridge University Press, 1997.
M. Lothaire, Algebraic Combinatorics on Words. Encyclopedia of Mathematics 90, Cambridge University Press, 2002.
R.C. Lyndon and P.E. Schupp, Combinatorial Group Theory, Springer-Verlag, 1977.
W. Magnus, A. Karrass and D. Solitar, Combinatorial Group Theory, Wiley, 1966.
G.S. Makanin, The problem of solvability of equations in a free semigroup, Mat. Sb. 103, 147–236, 1977 (English transi. in Math. USSR Sb. 32, 129–198 ).
F. Mignosi, A. Restivo, and S. Salemi, Periodicity and golden ratio, Theoret. Comput. Sci. 204, 153–167, 1998.
M.L. Minsky, Computation: Finite and Infinite Machines, Prentice-Hall, 1967.
M. Morse and G. Hedlund, Symbolic dynamics, Amer. J. Math. 60, 815–866, 1938.
M. Morse and G.A. Hedlund, Symbolic dynamics II: Sturmian trajectories. Amer. J. Math. 62, 1–42, 1940.
J.-J. Pansiot, Complexité des facteurs des mots infinis engendrés par morphismes intérés, In: J. Paredaens (ed.), Automata, Languages and Programming,LNCS 172, 380–389, Springer-Verlag, 1984. 410 Juhani Karhumäki and Arto Lepistö
W. Plandowski, Satisfiability of word equations is in PSPACE, Proc. of FOCS, 495–500, 1999.
E. Prouhet, Mémoire sur quelques relations entre les preissances des numbres, C. R. Acad. Sci. Paris 33, Cahier 31, 225, 1851.
A. Salomaa, Formal Languages, Academic Press, 1973.
M. P. Schützenberger, Une théorie algébrique du codage, Seminaire DubreilPisot 1955–1956 Expose 15, Institut H. Poincare, Paris, 1956.
J. Shallit, 2 methods for generating fractals, Computer E.4 Graphics 13(2), 185–191, 1989.
A. Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. K1., Christiana 7, 1–22, 1906.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Karhumäki, J., Lepistö, A. (2004). Combinatorics on Infinite Words. In: MartÃn-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-39886-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53554-3
Online ISBN: 978-3-540-39886-8
eBook Packages: Springer Book Archive