Pages that link to "Item:Q4839719"
From MaRDI portal
The following pages link to Pattern languages with and without erasing (Q4839719):
Displaying 26 items.
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Closure properties of pattern languages (Q340552) (← links)
- Inferring descriptive generalisations of formal languages (Q355503) (← links)
- Regular and context-free pattern languages over small alphabets (Q391783) (← links)
- Restricted ambiguity of erasing morphisms (Q551171) (← links)
- Pattern systems (Q672745) (← links)
- Multi-pattern languages (Q673787) (← links)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Remarks on arbitrary multiple pattern interpretations (Q845932) (← links)
- Discontinuities in pattern inference (Q924176) (← links)
- Existence and nonexistence of descriptive patterns (Q986561) (← links)
- Bad news on decision problems for patterns (Q1049406) (← links)
- 2-testability and relabelings produce everything (Q1271607) (← links)
- A note on the equivalence problem of \(E\)-patterns (Q1351579) (← links)
- On the equivalence problem for E-pattern languages (Q1389770) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (Q3073643) (← links)
- Bad News on Decision Problems for Patterns (Q3533022) (← links)
- Existence and Nonexistence of Descriptive Patterns (Q3637228) (← links)
- Finite degrees of ambiguity in pattern languages (Q4365010) (← links)
- Inclusion is undecidable for pattern languages (Q4630269) (← links)
- The equivalence problem of E-pattern languages with regular constraints is undecidable (Q6666804) (← links)
