The finiteness problem for automaton semigroups is undecidable

Pierre Gillibert

Published in: CoRR (2013)

Keyphrases

sufficient conditions
deterministic finite automata
hybrid automata
np complete
finite state automata
finite state machines
finite automata
datalog programs
deterministic finite automaton
database
expressive power
logic programming
turing machine
multiscale
range searching
case study
neural network
data sets