Pushdown automata with restricted use of storage symbols

  • Andreas Brandstädt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /1/.
    Book R.V., Greibach S.A., Quasi-realtime languages, Math. Syst. Theory 4 No. 2 (1970), 97–111Google Scholar
  2. /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–621Google Scholar
  3. /3/.
    Fischer P.C., Meyer A.R., Rosenberg A.L., Counter machines and counter languages, Math. Syst. Theory 2, No. 3 (1968), 265–283Google Scholar
  4. /4/.
    Aho A.V., Ullman J.D., The theory of parsing, translation and compiling, vol. 1, Prentice-Hall Englewood Cliffs N.J. 1972Google Scholar
  5. /5/.
    Ginsburg S., Greibach S.A., Deterministic Context-free languages, Information and Control, 9 (1966), 620–648Google Scholar
  6. /6/.
    Ogden W., A helpful result for proving inherent ambiguity, Math. Syst. Theory 2 (1968), 191–194Google Scholar
  7. /7/.
    Peterson W.W., Weldon Jr. E.J., Error-Correcting Codes, MIT Press 1972, Cambrigde Mass.Google Scholar
  8. /8/.
    Book, R.V., Comparing complexity classes, J. Comput. Syst. Sciences 2 (1974), 213–229Google Scholar
  9. /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. /10/.
    Ginsburg S., Algebraic and automata-theoretic properties of formal languages, North-Holland 1975Google Scholar
  11. /11/.
    Greibach S.A., Formal languages: origins and directions, 20 th Annual Symp. on Foundations of Comp. Science 1979, 66–90Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Andreas Brandstädt
    • 1
  1. 1.Sektion Mathematik der Friedrich-Schiller-UniversitätUniversitätshochhausJena

Personalised recommendations