Inductive identification of pattern languages restricted substitutions
COLT '90 Proceedings of the third 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
Inference of Reversible Languages
Journal of the ACM (JACM)
Characteristic sets for polynominal grammatical inference
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
Typed pattern languages and their learnability
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Inductive Inference, DFAs, and Computational Complexity
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Discontinuities in pattern inference
Theoretical Computer Science
Difficulties in forcing fairness of polynomial time inductive inference
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
| Hi-index | 0.00 |
This article proposes polynomial-time algorithms for learning typed pattern languages--formal languages that are generated by patterns consisting of terminal symbols and typed variables. A string is generated by a typed pattern by substituting all variables with strings of terminal symbols that belong to the corresponding types. The algorithms presented consitute non-trivial generalizations of Lange and Wiehagen's efficient algorithm for learning patterns in which variables are not typed. This is achieved by defining type witnesses to impose structural conditions on the types used in the patterns. It is shown that Lange and Wiehagen's algorithm implicitly uses a special case of type witnesses. Moreover, the type witnesses for a typed pattern form characteristic sets whose size is linear in the length of the pattern; our algorithm, when processing any set of positive data containing such a characteristic set, will always generate a typed pattern equivalent to the target pattern. Thus our algorithms are of relevance to the area of grammatical inference, in which such characteristic sets are typically studied.