Closure properties of pattern languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3817068 (Why is no real title available?)
- scientific article; zbMATH DE number 3710436 (Why is no real title available?)
- scientific article; zbMATH DE number 67629 (Why is no real title available?)
- A non-learnable class of E-pattern languages
- An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
- Bad news on decision problems for patterns
- Closure properties of pattern languages
- Decision problems for patterns
- Discontinuities in pattern inference
- Finding patterns common to a set of strings
- Identification of pattern languages from examples and queries
- Inductive inference of unbounded unions of pattern languages from positive data
- On the parameterised complexity of string morphism problems
- Pattern languages with and without erasing
- Pattern matching with variables: a multivariate complexity analysis
- Patterns with bounded treewidth
- Polynomial-time inference of arbitrary pattern languages
- Regular and context-free pattern languages over small alphabets
- Regular patterns, regular languages and context-free languages
- The equation \(a_ M=b^ Nc^ P\) in a free group
Cited in
(8)- Unambiguous injective morphisms in free groups
- Properties of Java Simple Closures
- On the closure of pattern expressions languages under intersection with regular languages
- Closure and nonclosure properties of the classes of compressible and rankable sets
- A closure property of regular languages
- Two non-closure results on families ofL languages
- Regular and context-free pattern languages over small alphabets
- Closure properties of pattern languages
This page was built for publication: Closure properties of pattern languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340552)
