Regular Languages Accepted by Quantum Automata.
Alberto BertoniMarco CarpentieriPublished in: Inf. Comput. (2001)
Keyphrases
- regular languages
- regular expressions
- finite automata
- grammatical inference
- context free languages
- decision problems
- context free grammars
- finite state machines
- pac learning
- finite state automata
- pattern matching
- positive data
- context free
- inductive inference
- machine learning
- finite state
- positive and negative
- decision makers
- relational databases