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

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

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

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

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)

Publication year

2014

Confidentiality

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

Name of the periodical

Journal of computer and system sciences

ISSN

0022-0000

e-ISSN

—

Volume of the periodical

80

Issue of the periodical within the volume

4

Country of publishing house

US - UNITED STATES

Number of pages

24

Pages from-to

720-743

UT code for WoS article

000331915400004

EID of the result in the Scopus database

—