Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata.
Pawel ParysPublished in: STACS (2011)
Keyphrases
- expressive power
- higher order
- query language
- first order logic
- data complexity
- transitive closure
- finite state automaton
- computational properties
- markov random field
- relational algebra
- regular expressions
- finite state
- relational calculus
- model checking
- relation algebra
- constraint query languages
- finite state machines
- tree automata
- context free
- search algorithm
- markov chain
- data model