Abstract
In no 32 of the EATCS Bulletin, Márton Kósa stated five conjectures concerning the study of some binary morphisms and the factors of the infinite words these morphisms generate [11].
I prove the first four conjectures, the main result being the characterization of a large class of morphisms which stationary words are Sturmian.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. ADJAN:The Burnside problem and identities in groups, Math. Grenzgeb. vol.95 — Springer (1979).
J.M. AUTEBERT — J. BEAUQUIER — L. BOASSON — M. NIVAT:Quelques problèmes ouverts en théorie des langages algébriques, RAIRO — Inf. Th. 13 (1979), p. 363–379.
J. BERSTEL:Mots de Fibonacci, L.I.T.P. Séminaire d'Informatique Théorique 1980–81, p. 57–78.
J. BERSTEL:Some recent results on square-free words, STACS Paris (1984).
E. BOMBIERI — J.E. TAYLOR:Which distributions of matter diffract? An initial investigation, J. Physique 47 (1986), p. 19–28.
J. BRZOZOWSKI — K. CULIK II — A. GABRIELIAN:Classification of noncounting events, J. Comp. Syst. Science 5 (1971), p. 41–53.
G. CHRISTOL — T. KAMAE — M. MENDÈS-FRANCE — G. RAUZY:Suites algébriques, automates et substitutions, Bull. Soc. Math. France 108 (1980), p. 401–419.
A. EHRENFEUCHT — G. ROZENBERG:Elementary homomorphisms and a solution to the D0L-sequence equivalence problem, Theor. Comp. Sci. 7 (1978), p. 169–183.
G. HEDLUND:Remarks on the work of Axel Thue on sequences, Nord. Mat. Tidskr. 16 (1967), p. 148–150.
J. KARHUMÄKI:On the equivalence problem for binary morphisms, Inform. and Control 50 (1981), p. 276–284.
M. KÓSA: in ‘Problems and Solutions', EATCS Bulletin 32 (1987), p. 331–333.
M. LOTHAIRE: "Combinatorics on words", Addison-Wesley (1983).
M. MORSE:Recurrent geodesics on a surface of negative curvature, Trans. Amer. Math. Soc. 22 (1921), p. 84–100.
M. MORSE — G. HEDLUND:Unending chess, symbolic dynamics and a problem in semi-groups, Duke Math. J. 11 (1944), p. 1–7.
G. RAUZY:Mots infinis en arithmétique, 12ième école de printemps d'Informatique Théorique — Le Mont Dore (1984) — in ‘Automata on infinite words', Lecture Notes in Computer Science 192 Springer, p. 165–171.
A. SALOMAA: ‘Jewels of formal language theory', Pitman (1981).
P. SÉÉBOLD:Sequences generated by infinitely iterated morphisms, Discrete Applied Mathematics 11 (1985), p. 255–264.
P. SÉÉBOLD: ‘Propriétés combinatoires des mots infinis engendrés par certains morphismes', Thèse de Doctorat (1985), Rapport L.I.T.P. 85-16.
P. SÉÉBOLD:An effective solution to the D0L periodicity problem in the binary case, EATCS Bulletin 36 (1988), p. 137–151.
J. SHALLIT:A generalization of automatic sequences, Theor. Comp. Sci. 61 (1988), p. 1–16.
A. THUE:Uber unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Math. Nat. kl. Christiania (1906), p. 1–22.
A. THUE:Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I. Math. Nat. kl. Christiania (1912), p. 1–67.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Séébold, P. (1989). About a family of binary morphisms which stationary words are Sturmian. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-51498-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51498-5
Online ISBN: 978-3-540-48180-5
eBook Packages: Springer Book Archive