Regular patterns, regular languages and context-free languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 67610 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3806956 (Why is no real title available?)
- A non-learnable class of E-pattern languages
- An introduction to Kolmogorov complexity and its applications
- Bad news on decision problems for patterns
- Finding patterns common to a set of strings
- Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Polynomial-time inference of arbitrary pattern languages
Cited in
(16)- Word equations in the context of string solving
- Prefix-free regular languages and pattern matching
- Regular and Context-Free Pattern Languages over Small Alphabets
- Regular and context-free pattern languages over small alphabets
- Overlap-Free Regular Languages
- Excessively duplicating patterns represent non-regular languages
- The complexity of verbal languages over groups
- Patterns in words and languages
- scientific article; zbMATH DE number 1134630 (Why is no real title available?)
- Distinguishing pattern languages with membership examples
- scientific article; zbMATH DE number 1822166 (Why is no real title available?)
- On the generative power of regular pattern grammars
- Finitely distinguishable erasing pattern languages
- Closure properties of pattern languages
- INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
- Syntactic structures of regular languages
This page was built for publication: Regular patterns, regular languages and context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675877)
