Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1978: Automata, Languages and Programming pp 353–362Cite as

States can sometimes do more than stack symbols in PDA's

Preliminary version

  • Conference paper
  • First Online:

  • 145 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 62))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill Book Company, 1966.

    Google Scholar 

  3. S. Ginsburg and N. Lynch, Size complexity in context-free grammar forms, J. ACM 23 (1976), 582–598.

    Article  Google Scholar 

  4. S. Ginsburg and E. H. Spanier, Finite-turn pushdown automata, SIAM J. Control 4, 423–434, 1966.

    Article  Google Scholar 

  5. 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 

  6. 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 

  7. 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 

  8. W. Ogden, A Helpful Result for Proving Inherent Ambiguity, Mathematical Systems Theory 2:3 (1968), 191–194.

    Article  Google Scholar 

  9. 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 

  10. 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 

  11. L. G. Valiant, A note on the succinctness of descriptions of deterministic languages, Inf. and Contr. 32 (1976), 139–145.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, The Pennsylvania State University, 16802, University Park, PA

    John K. Price & Detlef Wotschke

Authors
  1. John K. Price
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Detlef Wotschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Price, J.K., Wotschke, D. (1978). States can sometimes do more than stack symbols in PDA's. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

  • Online ISBN: 978-3-540-35807-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation