Abstract
The equivalence problem for deterministic pushdown automata is shown to be decidable. We exhibit a complete formal system for deducing equivalent pairs of deterministic rational series on the alphabet associated with a dpda M.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Beeri. An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata. TCS 3, pages 305–320, 1976.
D. Caucal. Bisimulation of context-free grammars and of pushdown automata. To appear in CSLI, Modal Logic and process algebra, vol. 53, Stanford, pages 1–20, 1995.
B. Courcelle. An axiomatic approach to the Korenjac-Hopcroft algorithms. Math. Systems theory, pages 191–231, 1983.
B. Courcelle. Recursive applicative program schemes. In Handbook of THeoretical Computer Science. edited by J. Van Leeuwen, pages 461–490. Elsevier, 1990.
S. Ginsburg and S. Greibaxch. Deterministic context-free languages. Information and Control, pages 620–648, 1966.
M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.
M.A. Harrison, I.M. Havel, and A. Yehudai. On equivalence of grammars through transformation trees. TCS 9, pages 173–205, 1979.
L.P. Lisovik. Hard sets methods and semilinear reservoir method with applications. In Proceedings 23rd ICALP, pages 229–231. Springer, LNCS 1099, 1996.
Y.V. Meitus. The equivalence problem for real-time strict deterministic pushdown automata. Kibernetika 5 (in russian, english translation in Cybernetics and Systems analysis), pages 14–25, 1989.
Y.V. Meitus. Decidability of the equivalence problem for deterministic pushdown automata. Kibernetika 5 (in russian, english translation in Cybernetics and Systems analysis), pages 20–45, 1992.
M. Oyamaguchi. The equivalence problem for real-time d.p.d.a's. J. assoc. Comput. Mach. 34, pages 731–760, 1987.
V.Yu. Romanovskii. Equivalence problem for real-time deterministic pushdown automata. Kibernetika no 2, pages 13–23, 1985.
G. Séniaergues. Formal languages and word-rewriting. In Term Rewriting, Advanced Course, pages 75–94. Springer, LNCS 909, edited by H. Comon and J.P.Jouannaud, 1994.
G. Sénizergues. L(A)=L(B)? Technical report, LaBRI, Université Bordeaux I, report nr1161-97. can be accessed at URL, http://www.labri.u-bordeaux.fr/, 1997.
C. Stirling. Decidability of bisimulation equivalence for normed pushdown processes. In Proceedings CONCUR 96, 1996.
L.G. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Information and Control 25, pages 123–133, 1974.
L.G. Valiant and M.S. Paterson. Deterministic one-counter automata. Journal of Computer and System Sciences 10. pages 340–350, 1975.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sénizergues, G. (1997). The equivalence problem for deterministic pushdown automata is decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_221
Download citation
DOI: https://doi.org/10.1007/3-540-63165-8_221
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63165-1
Online ISBN: 978-3-540-69194-5
eBook Packages: Springer Book Archive