On the equivalence problem for E-pattern languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 709539 (Why is no real title available?)
- scientific article; zbMATH DE number 743586 (Why is no real title available?)
- scientific article; zbMATH DE number 1414316 (Why is no real title available?)
- A note on the equivalence problem of \(E\)-patterns
- Decision problems for patterns
- Finding patterns common to a set of strings
- Inductive inference of formal languages from positive data
- Learning regular languages from counterexamples
- Pattern languages with and without erasing
Cited in
(13)- Pattern matching with variables: a multivariate complexity analysis
- Decision problems for pushdown threads
- Developments in Language Theory
- Bad News on Decision Problems for Patterns
- Discontinuities in pattern inference
- Document spanners: from expressive power to decision problems
- Inclusion problems for patterns with a bounded number of variables
- On the language equivalence of NE star-patterns
- Finitely distinguishable erasing pattern languages
- Bad news on decision problems for patterns
- A note on the complexity of matching patterns with variables
- An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
- Decision problems for patterns
This page was built for publication: On the equivalence problem for E-pattern languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389770)
