Quantum inductive inference by finite automata.
Rusins FreivaldsRichard F. BonnerPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- finite automata
- inductive inference
- grammatical inference
- recursive functions
- languages from positive data
- kolmogorov complexity
- deterministic automata
- intrinsic complexity
- hypothesis spaces
- regular languages
- algebraic structures
- positive data
- context free
- learning from positive data
- finite automaton
- tree automata
- pattern languages
- vc dimension
- transductive inference
- regular expressions
- machine learning
- case based learning
- real valued functions
- training data
- knowledge base