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

Authors:
Daniel Reidenbach
Affiliations:
Fachbereich Informatik, Technische Universität Kaiserslautern, Kaiserslautern, Germany
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 9
Cited 2

Decision problems for patterns

Journal of Computer and System Sciences
A note on the equivalence problem of E-patterns

Information Processing Letters
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Combinatorics of words

Handbook of formal languages, vol. 1
Morphisms

Handbook of formal languages, vol. 1
On the equivalence problem for E-pattern languages

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
Polynomial Time Inference of Extended Regular Pattern Languages

Proceedings of RIMS Symposium on Software Science and Engineering
The Relation of Two Patterns with Comparable Languages

STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science

Discontinuities in pattern inference

Theoretical Computer Science
An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We contribute new facets to the discussion on the equivalence problem for E-pattern languages (also referred to as extended or erasing pattern languages). This fundamental open question asks for the existence of a computable function that, given any pair of patterns, decides whether or not they generate the same language. Our main result disproves Ohlebusch and Ukkonen’s conjecture (Theoretical Computer Science 186, 1997) on the equivalence problem; the respective argumentation, that largely deals with the nondeterminism of pattern languages, is restricted to terminal alphabets with at most four distinct letters.