L(A)=L(B)? A simplified decidability pro
✍
Géraud Sénizergues
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 461 KB
We give a proof of decidability of the equivalence problem for deterministic pushdown automata, which simpliÿes that of SÃ enizergues (Theoret. Comput. Sci. 251 (2000) 1).