A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group.

Ines Klimann Matthieu Picantin Dmytro Savchuk

Published in: DLT (2015)

Keyphrases

state space
data sets
markov chain
optimal solution
search space
special case
connected components
state transition
deterministic finite automata