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

Published in: STACS (2013)

Keyphrases

transitive closure
function symbols
database
cellular automata
data sets
knowledge base
special case
first order logic
query evaluation
group members
deterministic finite automaton