The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable

Published in: CoRR (2012)

Keyphrases

markov chain
cellular automata
finite state machines
linear time temporal logic
database
randomly selected
real time
case study
model checking
finite automata
function symbols