The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10423144" target="_blank" >RIV/00216208:11320/21:10423144 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=W6_ByXZaIc" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=W6_ByXZaIc</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00224-020-09997-2" target="_blank" >10.1007/s00224-020-09997-2</a>
Alternative languages
Result language
angličtina
Original language name
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata
Original language description
We investigate the complexity of the containment problem "Does L(A) SUBSET OF OR EQUAL TO L(B) hold?" for register automata and timed automata, where B is assumed to be unambiguous and A is arbitrary. We prove that the problem is decidable in the case of register automata over (N,=), in the case of register automata over (Q,<) when B has a single register, and in the case of timed automata when B has a single clock.We give a 2-EXPSPACE algorithm in the first case, whose complexity is a single exponential in the case that B has a bounded number of registers. In the other cases, we give an EXPSPACE algorithm.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
R - Projekt Ramcoveho programu EK
Others
Publication year
2021
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
Name of the periodical
Theory of Computing Systems [online]
ISSN
1433-0490
e-ISSN
—
Volume of the periodical
2020
Issue of the periodical within the volume
2020
Country of publishing house
GB - UNITED KINGDOM
Number of pages
30
Pages from-to
—
UT code for WoS article
000570190700001
EID of the result in the Scopus database
2-s2.0-85091040673