Abstract
We introduce new tools allowing to deal with the equality-problem for prefix-free languages. We illustrate our ideas by showing that, for every fixed integer t ≥ 1, the equivalence problem for t-turn deterministic pushdown automata is co-NP. This complexity result refines those of [Val74, Bee76].
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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.
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.
S. Ginsburg and S. Greibach. 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.
T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCs 2002. LNCS, 2002.
G. Sénizergues. The Equivalence Problem for Deterministic Pushdown Automata is Decidable. In Proceedings ICALP 97, pages 671–681. Springer, LNCS 1256, 1997.
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.
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.
G. Sénizergues. L(A) = L(B) ? decidability results from complete formal systems. Theoretical Computer Science, 251:1–166, 2001.
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.
G. Sénizergues. L(A) = L(B) ? a simplified decidability proof. Theoretical Computer Science, 281:555–608, 2002.
G. Sénizergues. The equivalence problem for t-turn DPDA is co-NP. Technical report, LaBRI, 2003. Pages 1–26.
C. Stirling. Decidability of dpda’s equivalence. Technical report, Edinburgh ECS-LFCS-99-411, 1999. Pages 1–25.
C. Stirling. Decidability of dpda’s equivalence. Theoretical Computer Science, 255:1–31, 2001.
C. Stirling. Deciding DPDA Equivalence is Primitive Recursive. In Proceedings ICALP 02, pages 821–832. Springer, LNCS 2380, 2002.
L.G. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Information and Control 25, pages 123–133, 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sénizergues, G. (2003). The Equivalence Problem for t-Turn DPDA Is Co-NP. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_39
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive