Skip to main content
Conference Proceedings

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) (1997) 1256 671-681
DOI: 10.1007/3-540-63165-8_221
77Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The equivalence problem for deterministic pushdown automata is shown to be decidable. We exhibit a complete formal system for deducing equivalent pairs of deterministic rational series on the alphabet associated with a dpda M.

Author supplied keywords

Cite

CITATION STYLE

APA

Sénizergues, G. (1997). The equivalence problem for deterministic pushdown automata is decidable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 671–681). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_221

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free