On the equivalence problem for E-pattern languages
From MaRDI portal
Publication:1389770
DOI10.1016/S0304-3975(96)00289-7zbMath0903.68110OpenAlexW2051275734MaRDI QIDQ1389770
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00289-7
Related Items (9)
Document spanners: from expressive power to decision problems ⋮ Decision problems for pushdown threads ⋮ Inclusion problems for patterns with a bounded number of variables ⋮ Bad News on Decision Problems for Patterns ⋮ A note on the complexity of matching patterns with variables ⋮ Discontinuities in pattern inference ⋮ Finitely distinguishable erasing pattern languages ⋮ Bad news on decision problems for patterns ⋮ Pattern matching with variables: a multivariate complexity analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding patterns common to a set of strings
- Learning regular languages from counterexamples
- A note on the equivalence problem of \(E\)-patterns
- Decision problems for patterns
- Inductive inference of formal languages from positive data
- Pattern languages with and without erasing
This page was built for publication: On the equivalence problem for E-pattern languages
