Equivalence of pushdown automata via first-order grammars

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73607806" target="_blank" >RIV/61989592:15310/21:73607806 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0022000020300714" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0022000020300714</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2020.07.004" target="_blank" >10.1016/j.jcss.2020.07.004</a>

Result language
angličtina
Original language name
Equivalence of pushdown automata via first-order grammars
Original language description
A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by Senizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pushdown automata. The presented proof is conceptually simpler, and a particular novelty is that it is not given as two semidecision procedures but it provides an explicit algorithm that might be amenable to a complexity analysis.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA18-11193S" target="_blank" >GA18-11193S: Algorithms for Infinite-State Discrete Systems and Games</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)