RAIRO-Theor. Inf. Appl.
Volume 40, Number 3, July-September 2006Word Avoidability Complexity And Morphisms (WACAM)
|Page(s)||501 - 510|
|Published online||18 October 2006|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.