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
Synthesizing enumeration techniques for language learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
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
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
Machine Inductive Inference and Language Identification
Proceedings of the 9th Colloquium on Automata, Languages and Programming
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Finding patterns common to a set of strings (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
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)
Learning erasing pattern languages with queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Learning of erasing primitive formal systems from positive examples
Theoretical Computer Science - Algorithmic learning theory
Learning a subclass of regular patterns in polynomial time
Theoretical Computer Science - Algorithmic learning theory
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Relations between Gold-style learning and query learning
Information and Computation
Hi-index | 0.00 |
The question of learnability of the class of extended pattern languages is considered to be one of the eldest and outstanding open problems in inductive inference of formal languages. This paper provides an appropriate answer presenting a subclass - the terminal-free extended pattern languages - that is not learnable in the limit. In order to achieve this result we will have to limit the respective alphabet of terminal symbols to exactly two letters.In addition we will focus on the impact of ambiguity of pattern languages on inductive inference of terminal-free extended pattern languages. The conventional view on nondeterminism in patterns inspired by formal language theory is transformed into an approach that meets the requirements of inductive inference. These studies will lead to some useful learnability criteria for classes of terminal-free extended pattern languages.