States can sometimes do more than stack symbols in PDA's
In pushdown automata, states can sometimes do more than stack symbols. More precisely, reducing the state set by a factor of k may require an increase in the stack alphabet by a factor of k2. These results are based on the observation that the "triple construction" for converting a pushdown automaton into a context-free grammar is optimal.
KeywordsFinite Automaton Springer Lecture Note Deterministic Finite Automaton Start Symbol Pushdown Automaton
Unable to display preview. Download preview PDF.
- M. M. Geller, H. B. Hunt, III, T. G. Szymanski and J. D. Ullman, Economy of Description by Parsers, DPDAs and PDAs, 16th Annual Symposium on Foundations of Computer Science, 1975.Google Scholar
- S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill Book Company, 1966.Google Scholar
- J. Gruska, Descriptional complexity (of languages), a short survey, Proc. Conf. on Math. Foundations of Comp. Sci., Gdansk, September, 1976 (Springer Lecture Notes in Comp. Sci., Vol. 45), 65–80.Google Scholar
- H. B. Hunt, III, and T. G. Szymanski, On the complexity of grammar and related problems, Proc. 7th ACM Symp. on Theory of Computing, May, 1975, 54–65.Google Scholar
- A. R. Meyer and M. J. Fischer, Economy of description by automata, grammars, and formal systems, Proc. 12th Symp. on Switching and Automata Theory, October, 1971, 188–191.Google Scholar
- A. Pirická, Complexity and normal forms of context-free languages, Proc. Conf. on Math. Foundations of Comp. Sci., June, 1974 (Springer Lecture Notes in Comp. Sci., Vol. 28), 292–297.Google Scholar
- A. Pirická-Kelemenová, Greibach normal form complexity, Proc. Conf. on Math. Foundations of Comp. Sci., September, 1975 (Springer Lecture Notes in Comp. Sci., Vol. 32), 344–350.Google Scholar