On the equivalence problem for E-pattern languages
From MaRDI portal
Publication:1389770
DOI10.1016/S0304-3975(96)00289-7zbMATH Open0903.68110OpenAlexW2051275734MaRDI QIDQ1389770FDOQ1389770
Authors: Enno Ohlebusch, Esko Ukkonen 
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
Recommendations
Cites Work
- Inductive inference of formal languages from positive data
- Finding patterns common to a set of strings
- Pattern languages with and without erasing
- Decision problems for patterns
- A note on the equivalence problem of \(E\)-patterns
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning regular languages from counterexamples
- Title not available (Why is that?)
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)
