Equivalences of pushdown systems are hard
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86092899" target="_blank" >RIV/61989100:27240/14:86092899 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-54830-7_1" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-54830-7_1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-54830-7_1" target="_blank" >10.1007/978-3-642-54830-7_1</a>
Alternative languages
Result language
angličtina
Original language name
Equivalences of pushdown systems are hard
Original language description
Language equivalence of deterministic pushdown automata (DPDA) was shown to be decidable by Senizergues (1997, 2001); Stirling (2002) then showed that the problem is primitive recursive. Senizergues (1998, 2005) also generalized his proof to show decidability of bisimulation equivalence of (nondeterministic) PDA where epsilon-rules can be only deterministic and popping; this problem was shown to be nonelementary by Benedikt, Goeller, Kiefer, and Murawski (2013), even for PDA with no epsilon-rules. Herewe refine Stirling?s analysis and show that DPDA equivalence is in TOWER, i.e., in the ?least? nonelementary complexity class. The basic proof ideas remain the same but the presentation and the analysis are simplified, in particular by using a first-order term framework. The framework of (nondeterministic) first-order grammars, with term root-rewriting rules, is equivalent to the model of PDA with restricted epsilon-rules to which Senizergues?s decidability proof applies. We show that bi
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
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)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science. Volume 8412
ISBN
978-3-642-54829-1
ISSN
0302-9743
e-ISSN
—
Number of pages
28
Pages from-to
1-28
Publisher name
Springer
Place of publication
Berlin
Event location
Grenoble
Event date
Apr 4, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—