Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-01-26
Computer Science
Formal Languages and Automata Theory
12 pages, 9 figures
Scientific paper
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.
No associations
LandOfFree
Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jancar's formal system for deciding bisimulation of first-order grammars and its non-soundness will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-418876