Loading...
Please wait, while we are loading the content...
Similar Documents
Decidability of Bisimulation Equivalence for First-Order Grammars Petr Jančar
| Content Provider | Semantic Scholar |
|---|---|
| Author | Jancar, Petr |
| Copyright Year | 2011 |
| Abstract | A self-contained proof of the decidability of bisimulation equivalence for first-order grammars is given. This provides an alternative for Sénizergues’ decidability proof (1998,2005) for nondeterministic pushdown automata with deterministic popping ε-steps, which generalized his decidability proof for language equivalence of deterministic pushdown automata. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.vsb.cz/jancar/BISIM-PDA/bisim.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |