Decidability of DPDA Language Equivalence via First-Order Grammars
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86084450" target="_blank" >RIV/61989100:27240/12:86084450 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/12:86084450
Result on the web
<a href="http://ieeexplore.ieee.org/" target="_blank" >http://ieeexplore.ieee.org/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/LICS.2012.51" target="_blank" >10.1109/LICS.2012.51</a>
Alternative languages
Result language
angličtina
Original language name
Decidability of DPDA Language Equivalence via First-Order Grammars
Original language description
Decidability of language equivalence of deterministic pushdown automata (DPDA) was established by G. Senizergues (1997), who thus solved a famous long-standing open problem. A simplified proof, also providing a primitive recursive complexity upper bound,was given by C. Stirling (2002). In this paper, the decidability is re-proved in the framework of first-order terms and grammars (given by finite sets of root-rewriting rules). The proof is based on the abstract ideas used in the previous proofs, but the chosen framework seems to be more natural for the problem and allows a short presentation which should be transparent for a general computer science audience.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
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
2012 27TH Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
ISBN
978-0-7695-4769-5
ISSN
1043-6871
e-ISSN
—
Number of pages
10
Pages from-to
415-424
Publisher name
IEEE
Place of publication
New York
Event location
Dubrovník
Event date
Jun 25, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000309059900047