Learnability: Admissible, Co-finite, and Hypersimple Languages.
Ganesh BaligaJohn CasePublished in: ICALP (1993)
Keyphrases
- languages from positive data
- inductive inference
- finite automata
- limit from positive data
- positive data
- pattern languages
- grammatical inference
- recursively enumerable
- regular languages
- learning from positive data
- linear separability
- expressive power
- state space
- boolean functions
- finite number
- text summarization
- real valued functions
- cross lingual
- language independent
- linearly separable
- databases
- regular expressions
- neural network
- learning algorithm
- reinforcement learning
- support vector
- multi lingual
- data model
- query language
- uniform distribution