A Polynomial-time Algorithm for Learning k-variable Pattern Languages from Examples
- 1 January 1989
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Learning String Patterns and Tree Patterns from ExamplesPublished by Elsevier ,1990
- Crytographic limitations on learning Boolean formulae and finite automataPublished by Association for Computing Machinery (ACM) ,1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Queries and concept learningMachine Learning, 1988
- Learning in the presence of malicious errorsPublished by Association for Computing Machinery (ACM) ,1988
- Reductions among prediction problems: on the difficulty of predicting automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Identification of pattern languages from examples and queriesInformation and Computation, 1987
- Occam's RazorInformation Processing Letters, 1987
- Polynomial time inference of extended regular pattern languagesPublished by Springer Nature ,1983
- Finding patterns common to a set of stringsJournal of Computer and System Sciences, 1980