L(A) = L(B)? Decidability Results from Complete Formal Systems

@article{Snizergues2001LAL,
  title={L(A) = L(B)? Decidability Results from Complete Formal Systems},
  author={G{\'e}raud S{\'e}nizergues},
  journal={Theor. Comput. Sci.},
  year={2001},
  volume={251},
  pages={1-166}
}
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 boolean series on the alphabet associated with a dpda M. We then extend the result to deterministic pushdown transducers from a free monoid into an abelian group. A general algebraic and logical framework, inspired by Harrison et al. (Theoret. Comput. Sci. 9 (1979) 173–205), Conrcelle (Theoret. Comput. Sci. 6 (1978) 255… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 152 citations. REVIEW CITATIONS

11 Figures & Tables

Topics

Statistics

01020'02'04'06'08'10'12'14'16'18
Citations per Year

153 Citations

Semantic Scholar estimates that this publication has 153 citations based on the available data.

See our FAQ for additional information.