Login / Signup
Complexity of problems concerning reset words for cyclic and Eulerian automata.
Pavel Martyugin
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
np complete
decision problems
computational issues
problems involving
decision trees
computational complexity
worst case
constraint satisfaction problems
n gram
pattern matching
cellular automata
markov decision processes
solving problems