On Infinite Words Determined by Indexed Languages

  • Tim Smith
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8634)

Abstract

We characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under a coding. Since the other direction, that every morphic word is determined by some indexed language, also holds, this implies that the infinite words determined by indexed languages are exactly the morphic words. To obtain this result, we prove a new pumping lemma for the indexed languages, which may be of independent interest.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V.: Indexed grammars - an extension of context-free grammars. J. ACM 15(4), 647–671 (1968)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Aho, A.V.: Nested stack automata. J. ACM 16(3), 383–406 (1969)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, New York (2003)CrossRefGoogle Scholar
  4. 4.
    Berstel, J.: Properties of infinite words: Recent results. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol. 349, pp. 36–46. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  5. 5.
    Book, R.V.: On languages with a certain prefix property. Mathematical Systems Theory 10, 229–237 (1977)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Braud, L., Carayol, A.: Linear orders in the pushdown hierarchy. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 88–99. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Culik, K., Karhumäki, J.: Iterative devices generating infinite words. Int. J. Found. Comput. Sci. 5(1), 69–97 (1994)CrossRefMATHGoogle Scholar
  8. 8.
    Ehrenfeucht, A., Rozenberg, G., Skyum, S.: A relationship between ET0L and EDT0L languages. Theoretical Computer Science 1(4), 325–330 (1976)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Gazdar, G.: Applicability of indexed grammars to natural languages. In: Reyle, U., Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theories. Studies in Linguistics and Philosophy, vol. 35, pp. 69–94. Springer, Netherlands (1988)Google Scholar
  10. 10.
    Gilman, R.H.: A shrinking lemma for indexed languages. Theor. Comput. Sci. 163(1-2), 277–281 (1996)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Hayashi, T.: On derivation trees of indexed grammars: An extension of the uvwxy-theorem. Publications of the Research Institute for Mathematical Sciences 9, 61–92 (1973)Google Scholar
  12. 12.
    Hopcroft, J., Ullman, J.: Introduction to automata theory, languages, and computation. Addison-Wesley series in computer science. Addison-Wesley (1979)Google Scholar
  13. 13.
    Kari, L., Rozenberg, G., Salomaa, A.: L systems. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 253–328. Springer-Verlag New York, Inc. (1997)Google Scholar
  14. 14.
    Latteux, M.: Une note sur la propriété de prefixe. Mathematical Systems Theory 11, 235–238 (1978)CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Maslov, A.N.: Multilevel stack automata. Problems of Information Transmission 12, 38–43 (1976)Google Scholar
  16. 16.
    Rabkin, M.: Ogden’s lemma for ET0L languages. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 458–467. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  17. 17.
    Rozenberg, G., Salomaa, A.: Mathematical Theory of L Systems. Academic Press, Inc., Orlando (1980)MATHGoogle Scholar
  18. 18.
    Smith, T.: On infinite words determined by L systems. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 238–249. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  19. 19.
    Smith, T.: On Infinite Words Determined by Stack Automata. In: FSTTCS 2013. Leibniz International Proceedings in Informatics (LIPIcs), vol. 24, pp. 413–424. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl (2013)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2014

Authors and Affiliations

  • Tim Smith
    • 1
  1. 1.Northeastern UniversityBostonUSA

Personalised recommendations