Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86080910" target="_blank" >RIV/61989100:27240/11:86080910 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-642-22993-0_20" target="_blank" >http://dx.doi.org/10.1007/978-3-642-22993-0_20</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-22993-0_20" target="_blank" >10.1007/978-3-642-22993-0_20</a>

Result language

angličtina

Original language name

Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete

Original language description

We prove that deciding language equivalence of deterministic real-time one-counter automata is NL-complete, in stark contrast to the inclusion problem which is known to be undecidable. This yields a subclass of deterministic pushdown automata for which the precise complexity of the equivalence problem can be determined. Moreover, we show that deciding regularity is NL-complete as well.

Czech name

—

Czech description

—

Type

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

CEP classification

IN - Informatics

OECD FORD branch

—

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)

Publication year

2011

Confidentiality

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

Name of the periodical

Lecture Notes in Computer Science

ISSN

0302-9743

e-ISSN

—

Volume of the periodical

6907

Issue of the periodical within the volume

2011

Country of publishing house

DE - GERMANY

Number of pages

11

Pages from-to

194-205

UT code for WoS article

—

EID of the result in the Scopus database

—