Learnability: Admissible, Co-Finite, and Hypersimple Languages.
Ganesh BaligaJohn CasePublished in: J. Comput. Syst. Sci. (1996)
Keyphrases
- languages from positive data
- inductive inference
- limit from positive data
- positive data
- finite automata
- pattern languages
- recursively enumerable
- grammatical inference
- learning from positive data
- linear separability
- real valued functions
- regular languages
- expressive power
- language independent
- positive and negative
- recursive functions
- support vector
- state space
- feature space
- databases
- pac learning
- context free grammars
- dnf formulas
- finite number
- regular expressions
- sufficient conditions
- object oriented
- relational databases