Communications of the ACM
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Identification of pattern languages from examples and queries
Information and Computation
Learning pattern languages from a single initial example and from queries
COLT '88 Proceedings of the first annual workshop on Computational learning theory
A polynomial-time algorithm for learning k-variable pattern languages from examples
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Polynomial-time inference of arbitrary pattern languages
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Decision problems for patterns
Journal of Computer and System Sciences
Learnability of a subclass of extended pattern languages
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Machine Learning
Machine Learning
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Learning Pattern Languages Using Queries
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Efficient Learning of Semi-structured Data from Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Learning languages from positive data and a finite number of queries
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
A pattern is a finite string of constant and variable symbols. The non-erasing language generated by a pattern is the set of all strings of constant symbols that can be obtained by substituting nonempty strings for variables. In order to build the erasing language generated by a pattern, it is also admissible to substitute the empty string. The present paper deals with the problem of learning erasing pattern languages within Angluin's model of learning with queries. Moreover, the learnability of erasing pattern languages with queries is studied when additional information is available. The results obtained are compared with previously known results concerning the case that non-erasing pattern languages have to be learned.