Pattern languages with and without erasing
From MaRDI portal
Publication:4839719
Cites work
Cited in
(25)- Multi-pattern languages
- Pattern matching with variables: a multivariate complexity analysis
- 2-testability and relabelings produce everything
- Regular and context-free pattern languages over small alphabets
- Existence and nonexistence of descriptive patterns
- Restricted ambiguity of erasing morphisms
- A polynomial time match test for large classes of extended regular expressions
- Discontinuities in pattern inference
- Document spanners: from expressive power to decision problems
- Pattern systems
- Inclusion problems for patterns with a bounded number of variables
- On the equivalence problem for E-pattern languages
- Bad News on Decision Problems for Patterns
- Existence and Nonexistence of Descriptive Patterns
- A non-learnable class of E-pattern languages
- Finite degrees of ambiguity in pattern languages
- On the parameterised complexity of string morphism problems
- Remarks on arbitrary multiple pattern interpretations
- Inferring descriptive generalisations of formal languages
- Inclusion is undecidable for pattern languages
- Bad news on decision problems for patterns
- Finitely distinguishable erasing pattern languages
- Closure properties of pattern languages
- A note on the equivalence problem of \(E\)-patterns
- The equivalence problem of E-pattern languages with regular constraints is undecidable
This page was built for publication: Pattern languages with and without erasing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4839719)