Emptiness of Zero Automata Is Decidable.
Mikolaj BojanczykHugo GimbertEdon KelmendiPublished in: ICALP (2017)
Keyphrases
- automata theoretic
- tree automata
- temporal logic
- cellular automata
- finite automata
- finite state
- probabilistic automata
- regular expressions
- first order logic
- finite state machines
- lattice gas
- regular path queries
- data sets
- datalog programs
- function symbols
- timed automata
- query evaluation
- database
- transitive closure
- knowledge representation
- information systems
- databases
- computation tree logic