Inference of reversible languages (1982)

Cached

Download Links

by Dana Angluin , Yale Untverstty
Venue:Journal of the ACM, JACM
Citations:169 - 5 self

Documents Related by Co-Citation

893 Language identification in the limit – E Mark Gold - 1967
510 Learning regular sets from queries and counterexamples – D Angluin - 1988
220 Complexity of Automaton Identification from Given Data – E M Gold - 1978
103 Inferring regular languages in polynomial update time – J Oncina, P Garcia - 1992
1699 A Theory of the Learnable – L. G. Valiant - 1984
92 On the complexity of minimum inference of regular sets – D Angluin - 1978
306 Inductive inference: theory and methods – D Angluin, C H Smith - 1983
307 Cryptographic Limitations on Learning Boolean Formulae and Finite Automata – Michael Kearns, Leslie Valiant - 1989
136 Learning Stochastic Regular Grammars by Means of a State Merging Method – Rafael C. Carrasco, Jose Oncina - 1994
296 Inductive inference of formal languages from positive data – Dana Angluin - 1980
40 Grammatical inference: introduction and survey – K S Fu ad T L Booth - 1975
6 Regular Inference with a Tail-Clustering Method – Laurent Miclet - 1980
82 The minimum consistent DFA problem cannot be approximated within any polynomial – Leonard Pitt, Manfred K. Warmuth - 1993
75 Efficient Learning of Context-Free Grammars from Positive Structural Examples – Y Sakakibara - 1992
39 Learnability by fixed distributions – G Benedek, A Itai - 1988
343 Learning Information Extraction Rules for Semi-structured and Free Text – Stephen Soderland, Claire Cardie, Raymond Mooney - 1999
522 Wrapper Induction for Information Extraction – Nicholas Kushmerick - 1997
259 Toward a mathematical theory of inductive inference – L Blum, M Blum - 1975
298 A Scalable Comparison-Shopping Agent for the World-Wide Web – Robert B. Doorenbos, Oren Etzioni, Daniel S. Weld - 1997