Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition.
Masaki NakanishiKiyoharu HamaguchiToshinobu KashiwabaraPublished in: IEICE Trans. Inf. Syst. (2006)
Keyphrases
- expressive power
- first order logic
- query language
- data complexity
- relational algebra
- transitive closure
- aggregate functions
- database query languages
- computational properties
- sufficient conditions
- finite automata
- relation algebra
- regular expressions
- closure properties
- finite state
- artificial intelligence
- constraint databases