Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata
Formal Languages and Automata Theory
2014-09-09 v1
Abstract
A word is called a reset word for a deterministic finite 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 maximum 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).
Keywords
Cite
@article{arxiv.1409.2003,
title = {Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata},
author = {Vojtěch Vorel},
journal= {arXiv preprint arXiv:1409.2003},
year = {2014}
}
Comments
Extended version of a paper presented at LATA 2014