Inclusion problems for patterns with a bounded number of variables
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2150289 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3806956 (Why is no real title available?)
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Bad news on decision problems for patterns
- Decision problems for patterns
- Developments from enquiries into the learnability of the pattern languages from positive data
- Extended Regular Expressions: Succinctness and Decidability
- Finding a homomorphism between two words is NP-complete
- Finding patterns common to a set of strings
- Four Small Universal Turing Machines
- Frontier between decidability and undecidability: A survey
- Inclusion problems for patterns with a bounded number of variables
- On the equivalence problem for E-pattern languages
- Pattern languages with and without erasing
- Patterns and languages: An overview
- The ultimate challenge. The \(3x+1\) problem
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
Cited in
(6)- Pattern matching with variables: a multivariate complexity analysis
- Document spanners: from expressive power to decision problems
- Inclusion problems of languages generated by regular patterns and co-regular patterns
- Inclusion is undecidable for pattern languages
- Inclusion problems for patterns with a bounded number of variables
- The equivalence problem of E-pattern languages with regular constraints is undecidable
This page was built for publication: Inclusion problems for patterns with a bounded number of variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932172)
