Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10366160" target="_blank" >RIV/00216208:11320/17:10366160 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ic.2016.06.013" target="_blank" >http://dx.doi.org/10.1016/j.ic.2016.06.013</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ic.2016.06.013" target="_blank" >10.1016/j.ic.2016.06.013</a>

Result language
angličtina
Original language name
Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata
Original language description
A word is called a reset word for a deterministic ﬁnite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given length for a given automaton is known to be an NP-complete problem. We prove that it remains NP-complete even if restricted to Eulerian automata with binary alphabets as it has been conjectured by Martyugin (2011).
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA14-10799S" target="_blank" >GA14-10799S: Hybercubic, graph and hypergraph structures</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)