Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.
Mitsuo WakatsukiKiyoshi TeraguchiEtsuji TomitaPublished in: ICGI (2004)
Keyphrases
- positive data
- regular languages
- grammatical inference
- tree languages
- positive and negative
- positive examples
- finite automata
- pattern languages
- context free
- tree automata
- turing machine
- inductive inference
- accurate classification
- context free grammars
- noisy data
- data sets
- deterministic finite automata
- limit from positive data
- target concept
- training data
- decision trees