Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)
New proofs for jump dpda's
KeywordsTransitive 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.
- 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
- 3.Greibach, S., Jump-pda's, deterministic context-free languages, principal AFDL's and polynomial time recognition. Unpublished report.Google Scholar
- 5.Harrison, M.A., Introduction to Formal Language Theory. Addison-Wesley, 1978.Google Scholar
© Springer-Verlag Berlin Heidelberg 1979