Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.
Mitsuo WakatsukiEtsuji TomitaPublished in: IEICE Trans. Inf. Syst. (2008)
Keyphrases
- positive data
- regular languages
- grammatical inference
- tree languages
- positive and negative
- finite automata
- tree automata
- pattern languages
- positive examples
- turing machine
- training data
- context free
- regular expressions
- accurate classification
- deterministic finite automata
- inductive inference
- noisy data
- decision rules
- active learning
- data sets
- limit from positive data