Two decidability results for deterministic pushdown automata

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


Equivalence Problem Regular Language Inclusion Problem Intermediate Configuration Pushdown Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Friedman, E. P., The inclusion problem for simple languages, Theoret. Comput. Sci. 1 (1976) 297–316.CrossRefGoogle Scholar
  2. 2.
    Harrison, M. A. and Havel, I. M., Strict deterministic grammars, J. Comput. System. Sci. 7 (1973) 237–277.Google Scholar
  3. 3.
    Jaffe, V. A., Two classes of CF-languages with a solvable equivalence problem, Kibernetika, Kiev, 2 (1974) 89–93.Google Scholar
  4. 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. 5.
    Kriegel, H. P. and Maurer, H. A., Formal translations and Szilard languages, Information and Control 30 (1976) 187–198.CrossRefGoogle Scholar
  6. 6.
    Kriegel, H. P. and Ottmann, Th., Left-fitting translations, manuscript (1976).Google Scholar
  7. 7.
    Moriya, E., The associate language and the derivation properties of formal grammars, Information and Control 22 (1973) 139–162.CrossRefGoogle Scholar
  8. 8.
    Penttonen, M., On derivation languages corresponding to context-free grammars, Acta Informatica 3 (1974) 285–291.CrossRefGoogle Scholar
  9. 9.
    Rosenkranz, D. J. and Stearns, R. E., Properties of deterministic top-down grammars, Information and Control 17 (1970) 226–255.CrossRefGoogle Scholar
  10. 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. 11.
    Valiant, L. G., Decision problems for families of deterministic pushdown automata, Univ. of Warwick Computer Centre, Report No.7, 1973.Google Scholar
  12. 12.
    Valiant, L. G., The equivalence problem for deterministic finite-turn pushdown automata, Information and Control 25 (1974) 123–133.CrossRefGoogle Scholar
  13. 13.
    Valiant, L. G. and Paterson, M. S., Deterministic one-counter automata, J. Comput. System. Sci. 10 (1975) 340–350.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Matti Linna
    • 1
  1. 1.Department of MathematicsUniversity of TurkuTurku 50Finland

Personalised recommendations