Abstract
In his paper (Theoretical Computer Science, Vol 251 (2001), pages 1—166), the author gives a positive solution to the decidability of the equivalence problem for deterministic pushdown automata: Given two languages L 1 and L 2 accepted by deterministic pushdown automata decide whether L 1=L 2. The problem was posed by S. Ginsburg and S. Greibach in 1966 and various subcases were shown to be decidable over years. However, the full question remained elusive until it was finally settled by the awarded. He showed the problem to be decidable. The paper not only settles the equivalence problem for deterministic context-free languages, but also develops an entire machinery of new techniques which are likely to be useful in other contexts. They have already found useful in semantics of programming languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sénizergues, G. (2002). L(A) = L(B)? Decidability Results from Complete Formal Systems. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive