Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Identification of unions of languages drawn from an identifiable class
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
Discrete Applied Mathematics
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 1
On the equivalence problem for E-pattern languages
Theoretical Computer Science
Learnability of a subclass of extended pattern languages
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The synthesis of language learners
Information and Computation
An average-case optimal one-variable pattern language learner
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Handbook of Formal Languages
Stochastic Finite Learning of the Pattern Languages
Machine Learning
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
The Relation of Two Patterns with Comparable Languages
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
A Guided Tour Across the Boundaries of Learning Recursive Languages
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Formal language identification: query learning vs. gold-style learning
Information Processing Letters
Relations between gold-style learning and query learning
Information and Computation
A non-learnable class of E-pattern languages
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Discontinuities in pattern inference
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
On the equivalence problem for e-pattern languages over small alphabets
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Discontinuities in pattern inference
Theoretical Computer Science
Bad News on Decision Problems for Patterns
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Unambiguous Erasing Morphisms in Free Monoids
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Theoretical Computer Science
The unambiguity of segmented morphisms
Discrete Applied Mathematics
Bad news on decision problems for patterns
Information and Computation
Restricted ambiguity of erasing morphisms
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Restricted ambiguity of erasing morphisms
Theoretical Computer Science
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Polynomial-Time algorithms for learning typed pattern languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Patterns with bounded treewidth
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
Regular and context-free pattern languages over small alphabets
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Unambiguous 1-uniform morphisms
Theoretical Computer Science
Inferring descriptive generalisations of formal languages
Journal of Computer and System Sciences
A note on the complexity of matching patterns with variables
Information Processing Letters
Regular and context-free pattern languages over small alphabets
Theoretical Computer Science
Hi-index | 5.23 |
This paper deals with the inferrability of classes of E-pattern languages-also referred to as extended or erasing pattern languages-from positive data in Gold's model of identification in the limit. The first main part of the paper shows that the recently presented negative result on terminal-free E-pattern languages over binary alphabets does not hold for other alphabet sizes, so that the full class of these languages is inferrable from positive data if and only if the corresponding terminal alphabet does not consist of exactly two distinct letters. The second main part yields the insight that the positive result on terminal-free E-pattern languages over alphabets with three or four letters cannot be extended to the class of general E-pattern languages. With regard to larger alphabets, the extensibility remains open. The proof methods developed for these main results do not directly discuss the (non-)existence of appropriate learning strategies, but they deal with structural properties of classes of E-pattern languages, and, in particular, with the problem of finding telltales for these languages. It is shown that the inferrability of classes of E-pattern languages is closely connected to some problems on the ambiguity of morphisms so that the technical contributions of the paper largely consist of combinatorial insights into morphisms in word monoids.