New proofs for jump dpda's

  • Matti Linna
  • Martti Penttonen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Transitive Closure Formal Language Theory Mathematical System Theory Pushdown Automaton Single Jump 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cole, S.N., Deterministic pushdown store machines and real-time computation. Journal of the Association for Computing Machinery, 14(1971), 453–460.Google Scholar
  2. 2.
    Courcelle, B., On jump-deterministic pushdown automata. Mathematical Systems Theory, 11(1977), 87–109.CrossRefGoogle Scholar
  3. 3.
    Greibach, S., Jump-pda's, deterministic context-free languages, principal AFDL's and polynomial time recognition. Unpublished report.Google Scholar
  4. 4.
    Greibach, S., Jump-dpda's and hierarchies of deterministic context-free languages. SIAM Journal of Computing, 3(1974), 111–127.CrossRefGoogle Scholar
  5. 5.
    Harrison, M.A., Introduction to Formal Language Theory. Addison-Wesley, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Matti Linna
    • 1
  • Martti Penttonen
    • 1
  1. 1.Department of MathematicsUniversity of TurkuTurku 50Finland

Personalised recommendations