On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

Machine Learning

Volumn 19, Issue 2, 1995, Pages 153-179

  Yokomori, Takashi ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

iterative learning; polynomial time learnability in the limit; strictly deterministic automata

Indexed keywords

ERRORS; FINITE AUTOMATA; FORMAL LANGUAGES; ITERATIVE METHODS; LEARNING ALGORITHMS; POLYNOMIALS;

POLYNOMIAL TIME LEARNABILITY; STRICTLY DETERMINISTIC AUTOMATA;

LEARNING SYSTEMS;

EID: 0029308944     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1023/A:1022615325466     Document Type: Article

References (17)

1. Inductive inference of formal languages from positive data
2. Inference of reversible languages
3. Learning regular sets from queries and counterexamples
4. Negative results for equivalence queries
5. Learning syntax by automata induction
6. Language identification in the limit
7. Combining postulates of naturalness in inductive inference
8. The grammatical inference problem for the Szilard languages of linear grammars
9. Learning automata from ordered examples
10. Polynomial-time identification of strictly regular languages in the limit
11. A theory of the learnable