Preview
Unable to display preview. Download preview PDF.
References
Cole, S.N., Deterministic pushdown store machines and real-time computation. Journal of the Association for Computing Machinery, 14(1971), 453–460.
Courcelle, B., On jump-deterministic pushdown automata. Mathematical Systems Theory, 11(1977), 87–109.
Greibach, S., Jump-pda's, deterministic context-free languages, principal AFDL's and polynomial time recognition. Unpublished report.
Greibach, S., Jump-dpda's and hierarchies of deterministic context-free languages. SIAM Journal of Computing, 3(1974), 111–127.
Harrison, M.A., Introduction to Formal Language Theory. Addison-Wesley, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Linna, M., Penttonen, M. (1979). New proofs for jump dpda's. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_33
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive