Regular and context-free pattern languages over small alphabets
From MaRDI portal
Publication:391783
DOI10.1016/j.tcs.2013.07.035zbMath1358.68174OpenAlexW2117905172MaRDI QIDQ391783
Markus L. Schmid, Daniel Reidenbach
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.035
Related Items
Closure properties of pattern languages, Distinguishing pattern languages with membership examples, Finitely distinguishable erasing pattern languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time inference of arbitrary pattern languages
- Developments from enquiries into the learnability of the pattern languages from positive data
- Discontinuities in pattern inference
- Bad news on decision problems for patterns
- Finding patterns common to a set of strings
- Regular patterns, regular languages and context-free languages
- Decision problems for patterns
- Regular and Context-Free Pattern Languages over Small Alphabets
- Inclusion Problems for Patterns with a Bounded Number of Variables
- A Generalization of Ogden's Lemma
- Finite degrees of ambiguity in pattern languages
- Pattern languages with and without erasing
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Stochastic finite learning of the pattern languages
