On the equivalence problem for E-pattern languages over small alphabets

DOI10.1007/978-3-540-30550-7_31MaRDI QIDQ5711970zbMATH OpenOpenAlexFDO

Authors Daniel Reidenbach

Publication date 22 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b103739, https://figshare.com/articles/journal_contribution/On_the_equivalence_problem_for_E-pattern_languages_over_small_alphabets/9403184

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
• A note on the equivalence problem of \(E\)-patterns
• On the learnability of e-pattern languages over small alphabets
• On the equivalence problem for E-pattern languages
• Decision problems for patterns

Cited in

(10)

• On the language equivalence of NE star-patterns
• A note on the equivalence problem of \(E\)-patterns
• On the equivalence problem for E-pattern languages
• Regular and Context-Free Pattern Languages over Small Alphabets
• An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
• On the learnability of e-pattern languages over small alphabets
• The equivalence problem of E-pattern languages with regular constraints is undecidable
• The equivalence problem of E-pattern languages with length constraints is undecidable
• The equivalence problem of E-pattern languages with regular constraints is undecidable
• Discontinuities in pattern inference

This page was built for publication: On the equivalence problem for E-pattern languages over small alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711970)