Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence

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

Result language
angličtina
Original language name
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
Original language description
The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecified) finite-state process is shown to be decidable. The decidability is proven in the framework of first-order grammars, which are given by finite sets of labelled rules that rewrite roots of first-order terms. The framework is equivalent to PDA where also deterministic (i.e. alternative-free) epsilon-steps are allowed, hence to the model for which Sénizergues showed an involved procedure deciding bisimilarity (1998, 2005). Such a procedure is here used as a black-box part of the algorithm.
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
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)