The Decidability of Equivalence for Determistic Stateless Pushdown Automata
Michio OyamaguchiNamio HondaPublished in: Inf. Control. (1978)
Keyphrases
- automata theoretic
- query containment
- model checking
- temporal logic
- description logics
- cellular automata
- query answering
- finite state
- regular expressions
- probabilistic automata
- regular path queries
- decision procedures
- finite automata
- finite state machines
- lattice gas
- equivalence relation
- timed automata
- neural network
- type checking
- transitive closure
- finite state automata
- conjunctive queries
- knowledge representation
- artificial intelligence
- formal language theory
- databases