Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1981: Mathematical Foundations of Computer Science 1981 pp 234–241Cite as

Pushdown automata with restricted use of storage symbols

  • Communications
  • Conference paper
  • First Online:

  • 122 Accesses

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

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. Book R.V., Greibach S.A., Quasi-realtime languages, Math. Syst. Theory 4 No. 2 (1970), 97–111

    Google Scholar 

  2. Book R.V., Greibach S.A., Wegbreit B., Time-and tape-bounded Turing acceptors and AFL's, J. Comput. Syst. Sciences 4 (1970), 606–621

    Google Scholar 

  3. Fischer P.C., Meyer A.R., Rosenberg A.L., Counter machines and counter languages, Math. Syst. Theory 2, No. 3 (1968), 265–283

    Google Scholar 

  4. Aho A.V., Ullman J.D., The theory of parsing, translation and compiling, vol. 1, Prentice-Hall Englewood Cliffs N.J. 1972

    Google Scholar 

  5. Ginsburg S., Greibach S.A., Deterministic Context-free languages, Information and Control, 9 (1966), 620–648

    Google Scholar 

  6. Ogden W., A helpful result for proving inherent ambiguity, Math. Syst. Theory 2 (1968), 191–194

    Google Scholar 

  7. Peterson W.W., Weldon Jr. E.J., Error-Correcting Codes, MIT Press 1972, Cambrigde Mass.

    Google Scholar 

  8. Book, R.V., Comparing complexity classes, J. Comput. Syst. Sciences 2 (1974), 213–229

    Google Scholar 

  9. Brandstädt A., Space classes, intersections of one-counter languages, and bounded erasing homomorphisms and transductions, to appear in Theor. Comp. Science

    Google Scholar 

  10. Ginsburg S., Algebraic and automata-theoretic properties of formal languages, North-Holland 1975

    Google Scholar 

  11. Greibach S.A., Formal languages: origins and directions, 20 th Annual Symp. on Foundations of Comp. Science 1979, 66–90

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik der Friedrich-Schiller-Universität, Universitätshochhaus, Schillerstr., DDR-6900, Jena

    Andreas Brandstädt

Authors
  1. Andreas Brandstädt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandstädt, A. (1981). Pushdown automata with restricted use of storage symbols. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_89

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_89

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation