The equivalence problem for t-turn DPDA is co-NP

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

Volumn 2719, Issue , 2003, Pages 478-489

  Sénizergues, Géraud ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Complexity; Deterministic pushdown automata; Equivalence problem; Matrix semi groups

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

COMPLEXITY; COMPLEXITY RESULTS; DETERMINISTIC PUSHDOWN AUTOMATA; EQUIVALENCE PROBLEM; FIXED INTEGERS; PREFIX-FREE; SEMI-GROUP;

EQUIVALENCE CLASSES;

EID: 27144551294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_39     Document Type: Article

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. S. Fratani and G. Sénizergues. Iterated pushdown automata and sequences of rational numbers. Technical report, LaBRI, 2003. Draft.Pages 1-45. Available on the authors personal web-pages.
3. S. Ginsburg and S. Greibach. Deterministic context-free languages. Information and Control, pages 620-648, 1966.
4. M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.
5. M.A. Harrison, I.M. Havel, and A. Yehudai. On equivalence of grammars through transformation trees. TCS 9, pages 173-205, 1979.
6. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCs 2002. LNCS, 2002.
7. G. Sénizergues. The Equivalence Problem for Deterministic Pushdown Automata is Decidable. In Proceedings ICALP 97, pages 671-681. Springer, LNCS 1256, 1997.
8. G. Sénizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Rajeev Motwani, editor, Proceedings FOCS'98, pages 120-129. IEEE Computer Society Press, 1998.
9. G. Sénizergues. T(A) =T(B)? In Proceedings ICALP 99, volume 1644 of LNCS, pages 665-675. Springer-Verlag, 1999. Full proofs in technical report 1209-99 of LaBRI,T(A) = T(B)?, pages 1-61.
10. G. Sénizergues. L(A) = L(B) ? decidability results from complete formal systems. Theoretical Computer Science, 251:1-166, 2001.
11. G. Sénizergues. Some applications of the decidability of dpda's equivalence. In Proceedings MCU'01, volume 2055 of LNCS, pages 114-132. Springer-Verlag, 2001.
12. G. Sénizergues. L(A) = L(B) ? a simplified decidability proof. Theoretical Computer Science, 281:555-608, 2002.
13. G. Sénizergues. The equivalence problem for t-turn DPDA is co-NP. Technical report, LaBRI, 2003. Pages 1-26.
14. C. Stirling. Decidability of dpda's equivalence. Technical report, Edinburgh ECS-LFCS-99-411, 1999. Pages 1-25.
15. C. Stirling. Decidability of dpda's equivalence. Theoretical Computer Science, 255:1-31, 2001.
16. C. Stirling. Deciding DPDA Equivalence is Primitive Recursive. In Proceedings ICALP 02, pages 821-832. Springer, LNCS 2380, 2002.
17. L.G. Valiant. The equivalence problem for deterministic finite-turn push-down automata. Information and Control 25, pages 123-133, 1974.