Complexity of a problem concerning reset words for eulerian binary automata
V Vorel - International Conference on Language and Automata …, 2014 - Springer
V Vorel
International Conference on Language and Automata Theory and Applications, 2014•SpringerA word is called a reset word for a deterministic finite automaton if it maps all states of the
automaton to one state. Deciding about the existence of a reset word of given length for a
given automaton is known to be a NP-complete problem. We prove that it remains NP-
complete even if restricted on Eulerian automata over the binary alphabet, as it has been
conjectured by Martyugin (2011).
automaton to one state. Deciding about the existence of a reset word of given length for a
given automaton is known to be a NP-complete problem. We prove that it remains NP-
complete even if restricted on Eulerian automata over the binary alphabet, as it has been
conjectured by Martyugin (2011).
Abstract
A word is called a reset word for a deterministic finite automaton if it maps all states of the automaton to one state. Deciding about the existence of a reset word of given length for a given automaton is known to be a NP-complete problem. We prove that it remains NP-complete even if restricted on Eulerian automata over the binary alphabet, as it has been conjectured by Martyugin (2011).
Springer