Abstract
We reexamine pushdown machines from the device-oriented viewpoint, promulgated by Floyd, and by adding lookahead. We reprove some well-known results and prove some new results. First, we prove that every pushdown language is context free using two related yet different proof techniques. Second, we prove that every pushdown transduction is context free and, third, we prove that the language {aibi, aib2i: i≥ 1} is not a deterministic context-free language. In addition, we investigate lookahead deterministic pushdown machines that have only one state and that accept by empty pushdown. We examine their relationship with LL languages and prove that every LL language is a lookahead deterministic pushdown language, the language {aibi, aici: i≥0} is a. 1-lookahead deterministic pushdown language that is not LL(k), for any k≥1, and the language {ai0ai0, ai1ai1: i≥0} is not a k-lookahead deterministic pushdown language, for any k≥1. The latter result provides an alternative proof that the corresponding language is not LL(k), for any k≥1.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.C. Beatty. Two iteration theorems for the LL(k) languages. Theoretical Computer Science, 12: 193–228, 1980.
R.W. Floyd and R. Beigel. The Language of Machines: An Introduction to Computability and Formal Language Theory. Computer Science Press, San Francisco, CA, 1994.
J. Goldstine. Automata with data storage. In Proceedings of the Conference on Theoretical Computer Science, pages 239–246, Waterloo, Canada, 1977. University of Waterloo.
J. Goldstine. A rational theory of AFLs. In Proceedings of the Sixth Colloquium on Automata, Languages, and Programming, volume 71 of Lecture Notes in Computer Science, pages 271–281, New York, NY, 1979. Springer-Verlag.
J. Goldstine. Formal languages and their relation to automata: What Hopcroft & Ullman didn't tell us. In R.V. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 109–140, New York, NY, 1980. Academic Press.
M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978.
A.J. Korenjak and J.E. Hopcroft. Simple deterministic languages. In Proceedings of the Seventh Annual IEEE Symposium on Switching and Automata Theory, pages 36–46, 1966.
W. Kuich and H.A. Maurer. On the inherent ambiguity of tuple languages. Computing, 7: 194–203, 1971.
W. Kuich and H.A. Maurer. The structure generating function and entropy of tuple languages. Information and Control, 19: 195–203, 1971.
R. Kurki-Suonio. Describing automata in terms of languages associated with their peripheral devices. Technical Report STAN-CS-75-493, Computer Science Department, Stanford University, Stanford, CA, 1975.
D.J. Rosenkrantz and R.E. Stearns. Properties of deterministic top-down grammars. Information and Control, 17: 226–256, 1970.
A. Salomaa. Formal Languages. Academic Press, New York, NY, 1973.
K. Salomaa, D. Wood, and S. Yu. Pumping and pushdown machines. RAIRO Informatique théoretique, to appear, 1994.
J. van Leeuwen. An elementary proof that a certain context-free language is not LL(k), and a generalization. Unpublished manuscript, University of California, Berkeley, 1972.
D. Wood. Theory of Computation. John Wiley & Sons, Inc., New York, NY, second edition, 1994. In preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Salomaa, K., Wood, D., Yu, S. (1994). Rediscovering pushdown machines. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_60
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive