Skip to main content
SpringerLink
Log in

Pushdown-automata and families of languages generating cylinders

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1977 (MFCS 1977)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Autebert, J.-M., Non-principalité du cylindre des langages a computeur. To appear in Mathematical Systems Theory.

    Google Scholar 

  2. Autebert, J.-M., Cylindres de langages simples et pseudo-simples. In: Lecture Notes in Computer Science, 48 Springer-Verlag. (1977) 149–153.

    Google Scholar 

  3. Boasson, L. and Nivat, M., Le cylindre des langages linéaires. To appear in M.S.T.

    Google Scholar 

  4. Ginsburg, S., Golstine J., and Greibach, S., Some uniformely erasable families of languages. Theoretical Computer Science, 2, (1976) 29–44.

    Article  Google Scholar 

  5. Greibach, S., The hardest C. F. language. SIAM Journal, 2 (1973) 304–310.

    Article  Google Scholar 

  6. Greibach, S., Jump PDA's and hierarchies of deterministic C. F. languages. SIAM Journal, 3 (1974) 111–127.

    Article  Google Scholar 

  7. Shamir, E., A representation theorem for algebraic and C. F. power series in non-commutating variables. Information and Control, 11 (1967) 239–254.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire associé du C.N.R.S., Informatique Théorique et Programmation Institut de Programmation, 4 place Jussieu, 75230, PARIS CEDEX 05

    Jean-Michel Autebert

Authors
  1. Jean-Michel Autebert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Autebert, JM. (1977). Pushdown-automata and families of languages generating cylinders. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_140

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_140

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation