The following pages link to Decision problems for patterns (Q1892205):
Displaying 26 items.
- 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)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Subword conditions and subword histories (Q859831) (← links)
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- Discontinuities in pattern inference (Q924176) (← links)
- The unambiguity of segmented morphisms (Q967360) (← links)
- Existence and nonexistence of descriptive patterns (Q986561) (← links)
- Morphically primitive words (Q1019730) (← links)
- On the language equivalence of NE star-patterns (Q1041796) (← links)
- Bad news on decision problems for patterns (Q1049406) (← 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)
- Decision lists over regular patterns. (Q1874229) (← links)
- Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
- Unambiguous injective morphisms in free groups (Q2105430) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Learning erasing pattern languages with queries (Q2581361) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- Two-variable word equations (Q2729626) (← links)
- Ambiguity of Morphisms in a Free Group (Q3449361) (← links)
