The Finiteness Problem for Automaton Semigroups is Undecidable.
Pierre GillibertPublished in: Int. J. Algebra Comput. (2014)
Keyphrases
- sufficient conditions
- np complete
- finite automata
- datalog programs
- hybrid automata
- finite automaton
- deterministic finite automata
- finite state automata
- tree automata
- finite state machines
- range searching
- state space
- relational databases
- reinforcement learning
- decision trees
- computer vision
- artificial intelligence
- machine learning
- database