The equivalence problem for deterministic pushdown automata is decidable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 671-681

  Sénizergues, Géraud ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Complete formal systems; Deterministic pushdown automata; Finite dimensional vector spaces; Matrix semigroups; Rational series

Indexed keywords

COMPUTABILITY AND DECIDABILITY; EQUIVALENCE CLASSES; ROBOTS; VECTOR SPACES;

COMPLETE FORMAL SYSTEMS; DETERMINISTIC PUSHDOWN AUTOMATA; FINITE DIMENSIONAL VECTOR SPACES; MATRIX SEMIGROUPS; RATIONAL SERIES;

AUTOMATA THEORY;

EID: 84951060219     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_221     Document Type: Conference Paper

References (17)

1. C. Beeri. An improvement on Valiant's decision procedure for equivalence of deterministic finite-turn pushdown automata. TCS 3, pages 305-320, 1976.
2. 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.
3. B. Courcele. An axiomatic approach to the Korenjac-Hopcroft algorithms. Math. Systems theory, pages 191-231, 1983.
4. B. Courcelle. Recursive applicative program schemes. In Handbook of THeoretical Computer Science, edited by J. Van Leeuwen, pages 461-490. Elsevier, 1990.
5. S. Ginsburg and S. Greibach. Deterministic context-free languages. Information and Control, pages 620-648, 1966.
6. M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1918.
7. M.A. Harrison, I.M. Havel, and A. Yehudai. On equivalence of grammars through transformation trees. TCS 9, pages 173-205, 1979.
8. L.P. Lisovik. Hard sets methods and semilinear reservoir method with applications. In Proceedings 23rd ICALP, pages 229-231. Springer, LNCS 1099, 1996.
9. Y.V. Meitus. The equivalence problem for real-time strict deterministic pushdown automata. Kiber-netika S (in russian, english translation in Cybernetics and Systems analysis), pages 14-25, 1989.
10. Y.V. Meitus. Decidability of the equivalence problem for deterministic pushdown automata. Kibernetika S (in russian, english translation in Cybernetics and Systems analysis), pages 20-45, 1992.
11. M. Oyamagucht. The equivalence problem for real-time d.p.d.a's. J. assoc. Comput. Much. 34, pages 731-760, 1987.
12. V.Yu. Romanovskii, Equivalence problem for real-time deterministic pushdown automata. Kibernetika no 2, pages 13-23, 1985.
13. G. Sénizergues. 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.
14. 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.
15. C. Stirling, Decidability of bisimulation equivalence for normed pushdown processes. In Proceedings CONCUR 96, 1996.
16. L.G. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Information and Control 25, pages 123-133, 1974.
17. L.G. Valiant and M.S. Paterson. Deterministic one-counter automata. Journal of Computer and System Sciences 10. pages 340-350, 1975.