Bisimulation equivalence of first-order grammars

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86092897" target="_blank" >RIV/61989100:27240/14:86092897 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-662-43951-7_20" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-662-43951-7_20</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-43951-7_20" target="_blank" >10.1007/978-3-662-43951-7_20</a>

Result language
angličtina
Original language name
Bisimulation equivalence of first-order grammars
Original language description
A decidability proof for bisimulation equivalence of first- order grammars (i.e., finite sets of labelled rules for rewriting roots of first-order terms) is presented. The result, generalizing the decidability of the DPDA (deterministic pushdown automata) equivalence, is equivalent to the result achieved by Senizergues (1998, 2005) in the framework of equational graphs, or of PDA with restricted epsilon-steps, but the framework of classical first-order terms seems to be particularly useful for providinga concise proof that should be understandable for a wider audience.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP202%2F11%2F0340" target="_blank" >GAP202/11/0340: Modelling and verification of parallel systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)