On the Expressive Power of 2-Stack Visibly Pushdown Automata
Benedikt BolligPublished in: CoRR (2008)
Keyphrases
- expressive power
- query language
- first order logic
- data complexity
- relational algebra
- transitive closure
- cellular automata
- regular expressions
- finite automata
- computational properties
- finite state
- relational calculus
- model checking
- finite state machines
- closure properties
- xml data
- databases
- relational data
- logic programming
- database systems
- tree automata
- database