Polynomial-time identification of very regular languages in the limit.
Noriyuki TanidaTakashi YokomoriPublished in: ALT (1991)
Keyphrases
- regular languages
- finite automata
- context free languages
- positive data
- grammatical inference
- regular expressions
- equivalence queries
- statistical queries
- decision problems
- pac learning
- context free
- special case
- context free grammars
- reinforcement learning
- positive and negative
- hidden markov models
- active learning
- lower bound