Decision problems for patterns
From MaRDI portal
Recommendations
Cited in
(52)- Morphically primitive words
- On the language equivalence of NE star-patterns
- Bad news on decision problems for patterns
- A note on the equivalence problem of \(E\)-patterns
- On the equivalence problem for E-pattern languages
- Document spanners: from expressive power to decision problems
- Decision lists over regular patterns.
- Formulating patterns in problem solving
- Inclusion problems for patterns with a bounded number of variables
- Unambiguous injective morphisms in free groups
- On the decidability of infix inclusion problem
- Finitely distinguishable erasing pattern languages
- Pattern matching with variables: a multivariate complexity analysis
- Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
- A note on the complexity of matching patterns with variables
- Learning erasing pattern languages with queries
- Revisiting Shinohara's algorithm for computing descriptive patterns
- Two-variable word equations
- scientific article; zbMATH DE number 996382 (Why is no real title available?)
- Inclusion problems of languages generated by regular patterns and co-regular patterns
- Closure properties of pattern languages
- Ambiguity of morphisms in a free group
- An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
- Bad News on Decision Problems for Patterns
- Inferring descriptive generalisations of formal languages
- Unambiguous erasing morphisms in free monoids
- Inclusion problems for patterns with a bounded number of variables
- Unambiguous Erasing Morphisms in Free Monoids
- On Extended Regular Expressions
- Existence and Nonexistence of Descriptive Patterns
- Regular and context-free pattern languages over small alphabets
- scientific article; zbMATH DE number 522839 (Why is no real title available?)
- Detecting the morphic images of a word : improving the general algorithm
- The expressibility of languages and relations by word equations
- Inclusion is undecidable for pattern languages
- Goodby to the kindhearted dragon Prof. Sheng Yu, 1950--2012
- Restricted ambiguity of erasing morphisms
- Developments in Language Theory
- Inductive inference of unbounded unions of pattern languages from positive data
- On Billaud words and their companions
- On the decidability of infix inclusion problem
- The equivalence problem of E-pattern languages with regular constraints is undecidable
- Hardness results for constant-free pattern languages and word equations
- The Billaud conjecture for alphabet size 4
- The equivalence problem of E-pattern languages with length constraints is undecidable
- The equivalence problem of E-pattern languages with regular constraints is undecidable
- A non-learnable class of E-pattern languages
- Subword conditions and subword histories
- Developments from enquiries into the learnability of the pattern languages from positive data
- Discontinuities in pattern inference
- The unambiguity of segmented morphisms
- Existence and nonexistence of descriptive patterns
This page was built for publication: Decision problems for patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892205)
