The Equivalence Problem for Deterministic Pushdown Automata is Decidable.
Géraud SénizerguesPublished in: ICALP (1997)
Keyphrases
- datalog programs
- finite state automaton
- turing machine
- automata theoretic
- query containment
- finite state
- model checking
- cellular automata
- deterministic finite automata
- first order logic
- finite automata
- probabilistic automata
- conjunctive queries
- genetic algorithm
- tree automata
- state space
- database
- transitive closure
- randomized algorithms
- data sets
- situation calculus
- black box
- query answering