Note on the complexity of Las Vegas automata problems
Mathematical Institute, Slovak Academy of Sciences,
Grešákova 6, 040 01 Košice, Slovakia; email@example.com
Accepted: 29 August 2005
We investigate the complexity of several problems concerning Las Vegas finite automata. Our results are as follows. (1) The membership problem for Las Vegas finite automata is in NL. (2) The nonemptiness and inequivalence problems for Las Vegas finite automata are NL-complete. (3) Constructing for a given Las Vegas finite automaton a minimum state deterministic finite automaton is in NP. These results provide partial answers to some open problems posed by Hromkovič and Schnitger [Theoret. Comput. Sci. 262 (2001) 1–24)].
Mathematics Subject Classification: 68Q19 / 68Q17
Key words: Las Vegas finite automata / deterministic and nondeterministic finite automata / computational complexity.
© EDP Sciences, 2006