Skip to main content
SpringerLink
Log in

The Equivalence Problem for t-Turn DPDA Is Co-NP

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2719))

Included in the following conference series:

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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Beeri. An improvement on Valiant’s decision procedure for equivalence of deterministic finite-turn pushdown automata. TCS 3, pages 305–320, 1976.

    Google Scholar 

  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.

    Google Scholar 

  3. S. Ginsburg and S. Greibach. Deterministic context-free languages. Information and Control, pages 620–648, 1966.

    Google Scholar 

  4. M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.

    MATH  Google Scholar 

  5. M.A. Harrison, I.M. Havel, and A. Yehudai. On equivalence of grammars through transformation trees. TCS 9, pages 173–205, 1979.

    Google Scholar 

  6. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCs 2002. LNCS, 2002.

    Google Scholar 

  7. G. Sénizergues. The Equivalence Problem for Deterministic Pushdown Automata is Decidable. In Proceedings ICALP 97, pages 671–681. Springer, LNCS 1256, 1997.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  10. G. Sénizergues. L(A) = L(B) ? decidability results from complete formal systems. Theoretical Computer Science, 251:1–166, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  12. G. Sénizergues. L(A) = L(B) ? a simplified decidability proof. Theoretical Computer Science, 281:555–608, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  13. G. Sénizergues. The equivalence problem for t-turn DPDA is co-NP. Technical report, LaBRI, 2003. Pages 1–26.

    Google Scholar 

  14. C. Stirling. Decidability of dpda’s equivalence. Technical report, Edinburgh ECS-LFCS-99-411, 1999. Pages 1–25.

    Google Scholar 

  15. C. Stirling. Decidability of dpda’s equivalence. Theoretical Computer Science, 255:1–31, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  16. C. Stirling. Deciding DPDA Equivalence is Primitive Recursive. In Proceedings ICALP 02, pages 821–832. Springer, LNCS 2380, 2002.

    Google Scholar 

  17. L.G. Valiant. The equivalence problem for deterministic finite-turn pushdown automata. Information and Control 25, pages 123–133, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI and UFR Math-info, Université Bordeaux1, 351 Cours de la libération, 33405, Talence Cedex

    Géraud Sénizergues

Authors
  1. Géraud Sénizergues
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation