Some Classes of Regular Languages Identifiable in the Limit from Positive Data.
François DenisAurélien LemayAlain TerluttePublished in: ICGI (2002)
Keyphrases
- positive data
- regular languages
- grammatical inference
- context free languages
- positive and negative
- pattern languages
- regular expressions
- positive examples
- finite automata
- training data
- inductive inference
- noisy data
- context free grammars
- data sets
- statistical queries
- decision problems
- pattern matching
- machine learning
- boolean functions