Some Sufficient Conditions of Learnability in the Limit From Positive Data.
Takeshi OkadomePublished in: Int. J. Found. Comput. Sci. (2000)
Keyphrases
- sufficient conditions
- positive data
- limit from positive data
- pattern languages
- uniform convergence
- grammatical inference
- positive and negative
- positive examples
- linear systems
- inductive inference
- asymptotic stability
- exponential stability
- finite automata
- lyapunov function
- deterministic finite automata
- machine learning
- software engineering
- efficiently computable
- feature selection