A note on the equivalence problem of \(E\)-patterns

DOI10.1016/0020-0190(95)00212-XzbMath0875.68600OpenAlexW2067734219WikidataQ127814534 ScholiaQ127814534MaRDI QIDQ1351579

G. Dányi, Zoltán Fülöp

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00212-x

zbMATH Keywords

PatternsFormal languagesEquivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On the equivalence problem for E-pattern languages ⋮ Bad News on Decision Problems for Patterns ⋮ Bad news on decision problems for patterns

Cites Work

• Finding patterns common to a set of strings
• Decision problems for patterns
• Pattern languages with and without erasing

This page was built for publication: A note on the equivalence problem of \(E\)-patterns