Homomorphic Characterizations of Indexed Languages | SpringerLink
Skip to main content
Springer Nature Link
Log in

Homomorphic Characterizations of Indexed Languages

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9618))

Included in the following conference series:

Abstract

We study a family of context-free languages that reduce to \(\varepsilon \) in the free group and give several homomorphic characterizations of indexed languages relevant to that family.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.: Indexed grammars-an extension of context-free grammars. J. ACM 15, 647–671 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berstel, J.: Transductions and Context-Free Languages. Teubner Verlag, Wiesbaden (1979)

    Book  MATH  Google Scholar 

  3. Berstel, J., Boasson, L.: Context-free languages. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science (Vol. B), pp. 59–102. MIT Press, Cambridge (1990)

    Google Scholar 

  4. Berstel, J., Boasson, L.: Balanced grammars and their languages. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, pp. 3–25. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290(1), 79–115 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chomsky, N., Schützenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems. Studies in Logic and the Foundations of Mathematics, vol. 35, pp. 118–161. Elsevier, North-Holland (1963). doi:10.1016/S0049-237X(08)72023-8. http://www.sciencedirect.com/science/article/pii/S0049237X08720238. ISSN: 0049-237X

    Chapter  Google Scholar 

  7. Fischer, M.J.: Grammars with macro-like productions. In: 9th Annual Symposium on Switching and Automata Theory. pp. 131–142. IEEE Computer Society (1968)

    Google Scholar 

  8. Fratani, S.: Automates à piles de piles.. de piles. Ph.D. thesis, Université Bordeaux 1 (2005)

    Google Scholar 

  9. Hague, M., Murawski, A.S., Ong, C.L., Serre, O.: Collapsible pushdown automata and recursion schemes. In: Proceedings LICS, pp. 452–461. IEEE Computer Society (2008)

    Google Scholar 

  10. Hirose, S., Nasu, M.: Left universal context-free grammars and homomorphic characterizations of languages. Inf. Control 50(2), 110–118 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kanazawa, M.: Multidimensional trees and a Chomsky-Schützenberger Weir representation theorem for simple context-free tree grammars. J. Logic Comput. (2014). doi:10.1093/logcom/exu043. http://logcom.oxfordjournals.org/content/early/2014/06/30/logcom.exu043.abstract

    Google Scholar 

  12. Knapik, T., Niwiński, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 205–222. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Maslov, A.N.: Hierarchy of indexed languages of arbitrary level. Sov. Math. Dokl 115(14), 1170–1174 (1974)

    Google Scholar 

  14. Maslov, A.N.: Multilevel stack automata. Prob. Inf. Transm. 12, 38–43 (1976)

    Google Scholar 

  15. Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. Automata, Lang. Program. 85, 422–435 (1980)

    Article  MathSciNet  Google Scholar 

  16. Nivat, M.: Transductions des langages de Chomsky. Ann. Inst. Fourier 18(1), 339–455 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  17. Okhotin, A.: Non-erasing variants of the Chomsky–Schützenberger theorem. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 121–129. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Ong, L.: Higher-order model checking: an overview. In: LICS, pp. 1–15. IEEE Computer Society (2015)

    Google Scholar 

  19. Sorokin, A.: Monoid automata for displacement context-free languages. CoRR abs/1403.6060 (2014)

    Google Scholar 

  20. Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania , available as Technical Report MS-CIS-88-74 (1988)

    Google Scholar 

Download references

Acknowledgement

The authors would like to thank Pr. Jean-Marc Talbot whose remarks and suggestions greatly improved the development of this paper.

Author information

Authors and Affiliations

  1. Aix-Marseille Université, CNRS, LIF UMR 7279, 13000, Marseille, France

    Séverine Fratani & El Makki Voundy

Authors
  1. Séverine Fratani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. El Makki Voundy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to El Makki Voundy .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Czech Technical University, Prague, Czech Republic

    Jan Janoušek

  3. Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus Liebig University Giessen, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Fratani, S., Voundy, E.M. (2016). Homomorphic Characterizations of Indexed Languages. In: Dediu, AH., Janoušek, J., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science(), vol 9618. Springer, Cham. https://doi.org/10.1007/978-3-319-30000-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30000-9_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29999-0

  • Online ISBN: 978-3-319-30000-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics