Emptiness of zero automata is decidable.
Mikolaj BojanczykHugo GimbertEdon KelmendiPublished in: CoRR (2017)
Keyphrases
- automata theoretic
- tree automata
- temporal logic
- finite state
- finite automata
- cellular automata
- probabilistic automata
- regular expressions
- finite state automata
- regular path queries
- coalitional games
- transitive closure
- databases
- finite state machines
- model checking
- first order logic
- information systems
- lattice gas
- genetic algorithm
- datalog programs
- turing machine
- special case
- search algorithm
- timed automata
- formal language theory