Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness

2011/01/26 by Géraud Sénizergues, Sénizergues, Géraud
Computer Science · #F.4.2 #F.4.3 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #cs.FL #cs.LO

paper · pdf · doi:10.48550/arxiv.1101.5046

12 pages, 9 figures

arxiv created 2011/01/26 · arxiv updated 2011/01/27

Abstract

We construct an example of proof within the main formal system from arXiv:1010.4760v3, which is intended to capture the bisimulation equivalence for non-deterministic first-order grammars, and show that its conclusion is semantically false. We then locate and analyze the flawed argument in the soundness (meta)-proof of the above reference.

Citations

• A Short Decidability Proof for DPDA Language Equivalence via First-Order Grammars

Related

• Bisimulation Equivalence of First-Order Grammars
• Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
• Bisimulation equivalence of first-order grammars is Ackermann-hard
• Why the equivalence problem for unambiguous grammars has not been solved back in 1966?
• Simple grammar bisimilarity, with an application to session type equivalence