Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1989: STACS 89 pp 36–46Cite as

Properties of infinite words : Recent results

  • Invited Presentations
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 349))

Abstract

In this survey, two problems are considered. The first is to determine conditions on an infinite word such that the set of (finite) words which are not prefixes is context-free. The second is to describe how the number of factors of length n in an infinite word grows as a function of n. An application to a problem concerning semigroups motivates the second problem.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. M. Autebert, J. Beauquier, L. Boasson, M. Nivat, Quelques problèmes ouverts en théorie des langages, RAIRO Informatique théorique13 (1979), 363–379.

    Google Scholar 

  2. J. M. Autebert, P. Flajolet, J. Gabarró, Prefixes of infinite words and ambiguous context-free languages, Inform. Proc. Letters25 (1987), 211–216.

    Google Scholar 

  3. J. M. Autebert, J. Gabarró, Iterated gsm's and co-cfl, Acta Informatica, to appear.

    Google Scholar 

  4. C. Bader, A. Moura, A generalization of Ogden's lemma, J. Assoc. Comput. Mach.29 (1982), 404–407.

    Google Scholar 

  5. J. Berstel, Mots de Fibonacci, Séminaire d'informatique théorique, LITP, Paris, Année 1980/81, 57–78.

    Google Scholar 

  6. J. Berstel, Every iterated morphism yields a co-cfl, Inform. Proc. Letters22 (1986), 7–9.

    Google Scholar 

  7. R. D. Blyth, Rewriting products of group elements I, J. Algebra116 (1988), 506–521.

    Google Scholar 

  8. S. Brlek, Enumeration of factors in the Thue-Morse word, Discr. Appl. Math., to appear.

    Google Scholar 

  9. A. Cobham Uniform tag sequences, Math. Systems Theory6 (1972), 164–192.

    Google Scholar 

  10. K. Culik II, A. Salomaa On infinite words obtained by iterating morphisms, Theoret. Comput. Sci.19 (1982), 29–38.

    Google Scholar 

  11. M. Curzio, P. Longobardi, M. Maj, Su di un problema combinatorio in teoria dei gruppi, Atti Acc. Lincei Rend. Fis VIII74 (1983), 136–142.

    Google Scholar 

  12. M. Curzio, P. Longobardi, M. Maj, D. J. S. Robinson, A permutational property of groups, Arch. Math.44 (1985), 385–389.

    Google Scholar 

  13. A. de Luca, S. Varricchio, Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups, Theoret. Comput. Sci., to appear.

    Google Scholar 

  14. A. de Luca, S. Varricchio, Factorial languages whose growth function is quadratically upper bounded, Inform. Proc. Letters, to appear.

    Google Scholar 

  15. S. EilenbergAutomata, Languages, and Machines, Vol A, Academic Press, 1974

    Google Scholar 

  16. A. Ehrenfeucht, G. Rozenberg, On the subword complexity of D0L languages with a constant distribution, Inform. Proc. Letters16 (1981), 25–32.

    Google Scholar 

  17. P. Flajolet, Ambiguity and transcendence, in: Proc. 12th ICALP, Lecture Notes Comput. Sci.194 (1985), 179–188.

    Google Scholar 

  18. P. Flajolet, Analytic models and ambiguity of context-free languages, Theoret. Comput. Sci.49 (1987), 283–309.

    Google Scholar 

  19. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw Hill, 1966.

    Google Scholar 

  20. A. Grazon, An infinite word language which is not co-CFL, Inform. Proc. Letters24 (1987), 81–86.

    Google Scholar 

  21. T. Harju, M. Linna, On the periodicity of morphisms in free monoids, Theoret. Inform. Appl.20 (1986), 47–54.

    Google Scholar 

  22. G.A. Hedlund, M. Morse, Symbolic dynamics I,II, Amer. J. Math60 (1938), 815–866, 62 (1940), 1–42.

    Google Scholar 

  23. N. Herstein, Noncommutative Rings, Carus Math. Monographs, Math. Assoc. Amer., 1969.

    Google Scholar 

  24. J. Justin, G. Pirillo, Infinite words and permutation properties, Semigroup Forum, to appear.

    Google Scholar 

  25. J. Karhumäki, On cube-free ω-words generated by binary morphisms, Discr. Appl. Math.5 (1983), 279–297.

    Google Scholar 

  26. W. Kolakovski, Self generating runs, problem 5304, American Math. Monthly71 (1965), solution by N.Ucoluk, same journal 73 (1966), 681–682.

    Google Scholar 

  27. M. G. Main, An infinite square-free co-CFL, Inform. Proc. Letters20 (1985), 105–107.

    Google Scholar 

  28. M. G. Main, W. Bucher, D. Haussler, Application of an infinite square-free co-CFL, in: Proc. 12th ICALP, Lecture Notes Comput. Sci.194 (1985), 404–412, also Theoret. Comput. Sci.49 (1987), 113–119.

    Google Scholar 

  29. F. Mignosi Infinite words with linear subword complexity, Theoret. Comput. Sci., to appear.

    Google Scholar 

  30. M. Morse, G. Hedlund, Unending chess, symbolic dynamics, and a problem in semigroups, Duke Math. J.11 (1944), 1–7.

    Google Scholar 

  31. W. Ogden, R. Ross, K. Winklmann, An “interchange lemma” for context-free languages, SIAM J. Comput.14 (1985), 410–415.

    Google Scholar 

  32. J.-J. Pansiot, Decidability of periodicity for infinite words, Theoret. Inform. Appl.20 (1986), 43–46.

    Google Scholar 

  33. G. Rauzy, Sequences defined by iterated morphisms, in: Workshop on Sequences (R. Capocelli ed.), Lecture Notes Comput. Sci., to appear.

    Google Scholar 

  34. A. Restivo, Permutation properties and the Fibonacci semigroup, Semigroup Forum, to appear.

    Google Scholar 

  35. A. Restivo, C. Reutenauer, On the Burnside problem for semigroups, J. Algebra89 (1984), 102–104.

    Google Scholar 

  36. J. Shallit, A generalization of automatic sequences, Theoret. Comput. Sci.61 (1988), 1–16.

    Google Scholar 

  37. T. Tapsoba, Complexité de suites automatiques, Thèse 3e cycle, Université d'Aix-Marseille II, 1987.

    Google Scholar 

  38. A. Terlutte, Sur le centre de D0L-languages, Theoret. Inform. Appl.21 (1987), 137–146.

    Google Scholar 

  39. A. Terlutte, Contribution à l'étude des languages engendrés par des morphismes itérés, Thèse, Université de Lille I, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.T.P. Université Pierre et Marie Curie, Paris, France

    J. Berstel

Authors
  1. J. Berstel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berstel, J. (1989). Properties of infinite words : Recent results. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028971

Download citation

  • DOI: https://doi.org/10.1007/BFb0028971

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50840-3

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation