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
Handbook of formal languages, vol. 1
A Generalization of Ogden's Lemma
Journal of the ACM (JACM)
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
Discontinuities in pattern inference
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Bad news on decision problems for patterns
Information and Computation
Inclusion problems for patterns with a bounded number of variables
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Regular patterns, regular languages and context-free languages
Information Processing Letters
Regular and context-free pattern languages over small alphabets
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 5.23 |
Pattern languages are generalisations of the copy language, which is a standard textbook example of a context-sensitive and non-context-free language. In this work, we investigate a counter-intuitive phenomenon: with respect to alphabets of size 2 and 3, pattern languages can be regular or context-free in an unexpected way. For this regularity and context-freeness of pattern languages, we give several sufficient and necessary conditions and improve known results.