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
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Learnability of a subclass of extended pattern languages
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning one-variable pattern languages in linear average time
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
The synthesis of language learners
Information and Computation
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
Abelian Squares are Avoidable on 4 Letters
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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
A Negative Result on Inductive Inference of Extended Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning 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
Journal of Automata, Languages and Combinatorics
Unambiguous Erasing Morphisms in Free Monoids
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
The unambiguity of segmented morphisms
Discrete Applied Mathematics
Bad news on decision problems for patterns
Information and Computation
The unambiguity of segmented morphisms
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Regular patterns, regular languages and context-free languages
Information Processing Letters
Automatic learning of subclasses of pattern languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Unambiguous morphic images of strings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Patterns with bounded treewidth
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
The Complexity of Verbal Languages over Groups
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Automatic learning of subclasses of pattern languages
Information and Computation
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
| Hi-index | 0.00 |
We investigate the inferrability of E-pattern languages (also known as extended or erasing pattern languages) from positive data in Gold's learning model. As the main result, our analysis yields a negative outcome for the full class of E-pattern languages--and even for the subclass of terminal-free E-pattern languages--if the corresponding terminal alphabet consists of exactly two distinct letters. Furthermore, we present a positive result for a manifest subclass of terminal-free E-pattern languages. We point out that the considered problems are closely related to fundamental questions concerning the nondeterminism of E-pattern languages.