The Containment Problem for Unambiguous Register Automata.
Antoine MottetKarin QuaasPublished in: STACS (2019)
Keyphrases
- automata theoretic
- cellular automata
- regular expressions
- regular path queries
- finite automata
- finite state machines
- finite state
- probabilistic automata
- temporal logic
- conjunctive queries
- set valued attributes
- tree patterns
- containment of conjunctive queries
- lattice gas
- transitive closure
- query optimization
- case study
- tree automata
- finite state automata
- genetic algorithm
- np hard
- relational databases