On the Expressive Power of 2-Stack Visibly Pushdown Automata.
Benedikt BolligPublished in: Log. Methods Comput. Sci. (2008)
Keyphrases
- expressive power
- query language
- first order logic
- finite state
- model checking
- regular expressions
- data complexity
- cellular automata
- finite automata
- relational algebra
- finite state machines
- computational properties
- transitive closure
- closure properties
- tree automata
- aggregate functions
- artificial intelligence
- data model
- relational calculus
- recursive queries