Subset Synchronization of Transitive Automata
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10281308" target="_blank" >RIV/00216208:11320/14:10281308 - isvavai.cz</a>
Výsledek na webu
<a href="http://eptcs.web.cse.unsw.edu.au/paper.cgi?AFL2014.26" target="_blank" >http://eptcs.web.cse.unsw.edu.au/paper.cgi?AFL2014.26</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4204/EPTCS.151.26" target="_blank" >10.4204/EPTCS.151.26</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Subset Synchronization of Transitive Automata
Popis výsledku v původním jazyce
We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such wordsis superpolynomial in worst cases, namely in a series of substantially nontransitive automata. We present a series of transitive binary automata with a strongly exponential minimum length. This also constitutes a progress in the research of compositionsequences initiated by Arto Salomaa, because reset words of subsets are just a special case of composition sequences. Deciding about the existence of a reset word for given automaton and subset is known to be a PSPACE-complete problem, we prove that thisholds even if we restrict the problem to transitive binary automata.
Název v anglickém jazyce
Subset Synchronization of Transitive Automata
Popis výsledku anglicky
We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such wordsis superpolynomial in worst cases, namely in a series of substantially nontransitive automata. We present a series of transitive binary automata with a strongly exponential minimum length. This also constitutes a progress in the research of compositionsequences initiated by Arto Salomaa, because reset words of subsets are just a special case of composition sequences. Deciding about the existence of a reset word for given automaton and subset is known to be a PSPACE-complete problem, we prove that thisholds even if we restrict the problem to transitive binary automata.
Klasifikace
Druh
O - Ostatní výsledky
CEP obor
IN - Informatika
OECD FORD obor
—
Návaznosti výsledku
Projekt
<a href="/cs/project/GA14-10799S" target="_blank" >GA14-10799S: Hyperkrychlové, grafové a hypergrafové struktury</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Ostatní
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ů