Skip to main content
SpringerLink
Log in

Two decidability results for deterministic pushdown automata

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1977 (MFCS 1977)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Friedman, E. P., The inclusion problem for simple languages, Theoret. Comput. Sci. 1 (1976) 297–316.

    Article  Google Scholar 

  2. Harrison, M. A. and Havel, I. M., Strict deterministic grammars, J. Comput. System. Sci. 7 (1973) 237–277.

    Google Scholar 

  3. Jaffe, V. A., Two classes of CF-languages with a solvable equivalence problem, Kibernetika, Kiev, 2 (1974) 89–93.

    Google Scholar 

  4. Korenjak, A. J. and Hopcroft, J. E., Simple deterministic languages, IEEE Conf. Record of 7th Annual Symp. on Switching and Automata Theory (1966) 36–46.

    Google Scholar 

  5. Kriegel, H. P. and Maurer, H. A., Formal translations and Szilard languages, Information and Control 30 (1976) 187–198.

    Article  Google Scholar 

  6. Kriegel, H. P. and Ottmann, Th., Left-fitting translations, manuscript (1976).

    Google Scholar 

  7. Moriya, E., The associate language and the derivation properties of formal grammars, Information and Control 22 (1973) 139–162.

    Article  Google Scholar 

  8. Penttonen, M., On derivation languages corresponding to context-free grammars, Acta Informatica 3 (1974) 285–291.

    Article  Google Scholar 

  9. Rosenkranz, D. J. and Stearns, R. E., Properties of deterministic top-down grammars, Information and Control 17 (1970) 226–255.

    Article  Google Scholar 

  10. Taniguchi, K. and Kasami, T., A result on the equivalence problem for deterministic pushdown automata, J. Comput. System. Sci. 13 (1976) 38–50.

    Google Scholar 

  11. Valiant, L. G., Decision problems for families of deterministic pushdown automata, Univ. of Warwick Computer Centre, Report No.7, 1973.

    Google Scholar 

  12. Valiant, L. G., The equivalence problem for deterministic finite-turn pushdown automata, Information and Control 25 (1974) 123–133.

    Article  Google Scholar 

  13. Valiant, L. G. and Paterson, M. S., Deterministic one-counter automata, J. Comput. System. Sci. 10 (1975) 340–350.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, 20500, Turku 50, Finland

    Matti Linna

Authors
  1. Matti Linna
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Linna, M. (1977). Two decidability results for deterministic pushdown automata. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_157

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_157

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation