The Complexity of Finding Reset Words in Finite Automata.

Jörg Olschewski Michael Ummels

Published in: MFCS (2010)

Keyphrases

finite automata
deterministic automata
regular expressions
grammatical inference
probabilistic automata
tree automata
database
hidden markov models
regular languages
finite automaton
machine learning
relational databases
query processing
information theoretic