Abstract
Decidability of the equivalence problem is proved for deterministic pushdown automata. A comparison algorithm for two automata is described. The main theorem leads to solution of a number of open problems in the theory of program schemes and in formal language theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Ginsburg, The Mathematical Theory of Context Free Languages McGraw-Hill, New York (1966).
S. Ginsburg and S. Greibach, “Deterministic context-free languages,” IEEE Conf. Record on Switching Circuit Theory and Logical Design (Oct. 1965), pp. 203–220.
S. Ginsburg and S. Greibach, “Deterministic context-free languages,” Inform. Contr.,9, No. 6, 620–648 (1966).
D. Knuth, “On the translation of languages from left to right,” Inform. Contr.,8, No. 6, 607–639 (1965).
D. Rosenkrantz and R. Stearns, “Properties of deterministic top-down grammars,” Inform. Contr.,17, No. 3, 226–256 (1970).
A. Korenjak and J. Hopcroft, “Simple deterministic languages,” IEEE 7th Annual Symp. on Switching and Automata Theory Design, Berkeley (1966), pp. 36–46.
Z. Valiant, “The decidability of equivalence for deterministic finite-turn pushdown automata,” Inform. Contr.,25, No. 2, 123–133 (1974).
K. Taniguchi and T. Kasami, “A result on the equivalence problem for deterministic pushdown automata,” JCSS,13, No. 1, 38–50 (1976).
Z. Valiant and M. Paterson, “Deterministic one-counter automata,” JCSS,13, No. 1, 340–350 (1975).
M. Zinna, “Two decidability results for deterministic pushdown automata,” Lect. Notes Comput. Sci.,53, 365–373 (1977).
V. V. Zubenkov, “On finite backtracking automata,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 3, 838–841 (1978).
V. Yu. Romanovskii, “Equivalence problem of real-time deterministic pushdown automata,” Kibernetika, No. 2, 13–23 (1985).
A. A. Letichevskii, “On relations representable in push-down automata,” Kibernetika, No. 1, 1–9 (1969).
A. Aho and D. Ullman, Theory of Parsing, Translation, and Compiling [Russian translation], Vols. 1, 2, Mir, Moscow (1978).
D. Lehman, “LR(k)-grammars and deterministic languages,” in: Languages and Automata [Russian translation], Mir, Moscow (1975), pp. 43–46.
A. V. Anisimov, “Automaton characterization of parsing methods with regular control,” Kibernetika, No. 1, 1–8 (1976).
E. Fridman, “Equivalence problems for deterministic context-free languages and monadic recursion schemes,” JCSS,14, No. 3, 344–359 (1977).
S. Garland and D. Zuckham, “Program schemes, recursion schemes, and formal languages,” JCSS,7, No. 2, 119–160 (1973).
M. Geller and M. Harrison, “Characterization ofLR(0)-languages,” Proc. 14th Annual Symp. on Switching and Automata Theory, Iowa City (1973), pp. 103–108.
V. Yu. Meitus, “The equivalence problem for real-time strict deterministic pushdown automata,” Kibernetika, No. 5, 14–27 (1989).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 20–45, September–October, 1992.
Rights and permissions
About this article
Cite this article
Meitus, V.Y. Decidability of the equivalence problem for deterministic pushdown automata. Cybern Syst Anal 28, 672–690 (1992). https://doi.org/10.1007/BF01131845
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01131845