Inductive inference of formal languages from positive data

Information and Control

Volumn 45, Issue 2, 1980, Pages 117-135

  Angluin, Dana ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000106131     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(80)90285-5     Document Type: Article

References (14)

1. On the complexity of minimum inference of regular sets
2. Finding patterns common to a set of strings
3. On the prediction of general recursive functions
4. On the inference of Turing machines from sample computations
5. Toward a mathematical theory of inductive inference
6. Anomaly hierarchies of mechanized inductive inference
7. Some decidability results on grammatical inference and complexity
8. Language identification in the limit
9. Complexity of automaton identification from given data
10. Induction, pure and simple
11. A formal theory of inductive inference
12. A formal theory of inductive inference