L(A)=L(B)? A simplified decidability proof

✍ Scribed by Géraud Sénizergues

• Book ID: 104325340
• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 461 KB
• Volume: 281
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(02)00027-0

✦ Synopsis

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).