Bisimulation equivalence and regularity for real-time one-counter automata

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86092876" target="_blank" >RIV/61989100:27240/14:86092876 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S0022000013001906" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0022000013001906</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jcss.2013.11.003" target="_blank" >10.1016/j.jcss.2013.11.003</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Bisimulation equivalence and regularity for real-time one-counter automata

Popis výsledku v původním jazyce

A one-counter automaton is a pushdown automaton with a singleton stack alphabet, where stack emptiness can be tested; it is a real-time automaton if it contains no epsilon-transitions. We study the computational complexity of the problems of equivalenceand regularity (i.e. semantic finiteness) on real-time one-counter automata. The first main result shows PSPACE-completeness of bisimulation equivalence; this closes the complexity gap between decidability and PSPACE-hardness. The second main result shows NL-completeness of language equivalence of deterministic real-time one-counter automata; this improves the known PSPACE upper bound (indirectly shown by Valiant and Paterson in 1970s). Finally we prove P-completeness of the problem if a given one-counter automaton is bisimulation equivalent to a finite system, and NL-completeness of the problem if the language accepted by a given deterministic real-time one-counter automaton is regular.

Název v anglickém jazyce

Bisimulation equivalence and regularity for real-time one-counter automata

Popis výsledku anglicky

A one-counter automaton is a pushdown automaton with a singleton stack alphabet, where stack emptiness can be tested; it is a real-time automaton if it contains no epsilon-transitions. We study the computational complexity of the problems of equivalenceand regularity (i.e. semantic finiteness) on real-time one-counter automata. The first main result shows PSPACE-completeness of bisimulation equivalence; this closes the complexity gap between decidability and PSPACE-hardness. The second main result shows NL-completeness of language equivalence of deterministic real-time one-counter automata; this improves the known PSPACE upper bound (indirectly shown by Valiant and Paterson in 1970s). Finally we prove P-completeness of the problem if a given one-counter automaton is bisimulation equivalent to a finite system, and NL-completeness of the problem if the language accepted by a given deterministic real-time one-counter automaton is regular.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F11%2F0340" target="_blank" >GAP202/11/0340: Modelování a verifikace paralelních systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název periodika

Journal of computer and system sciences

ISSN

0022-0000

e-ISSN

—

Svazek periodika

80

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

24

Strana od-do

720-743

Kód UT WoS článku

000331915400004

EID výsledku v databázi Scopus

—