Opening book details…
Can I read L(A)=L(B)? decidability results from complete formal systems on EtoBox?
L(A)=L(B)? decidability results from complete formal systems by Géraud Sénizergues is a Computer Science article available to read on EtoBox.
What is L(A)=L(B)? decidability results from complete formal systems about?
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.
Who reads L(A)=L(B)? decidability results from complete formal systems?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Géraud Sénizergues
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)
- Published
- 2001
- Language
- EN
- Field
- Computer Science (Physical Sciences)