Equivalence Queries and Approximate Fingerprints
- 1 January 1989
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Crytographic limitations on learning Boolean formulae and finite automataPublished by Association for Computing Machinery (ACM) ,1989
- Queries and concept learningMachine Learning, 1988
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988
- Learning Automata from Ordered ExamplesPublished by Defense Technical Information Center (DTIC) ,1988
- Predicting (0, 1)-functions on randomly drawn pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Reductions among prediction problems: on the difficulty of predicting automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Occam's RazorInformation Processing Letters, 1987
- A theory of the learnableCommunications of the ACM, 1984
- Inference of Reversible LanguagesJournal of the ACM, 1982