Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/3472

Title: On the equivalence problem for E-pattern languages over small alphabets
Authors: Reidenbach, Daniel
Issue Date: 2005
Publisher: © Springer-Verlag
Citation: REIDENBACH, D., 2005. On the equivalence problem for E-pattern languages over small alphabets. Lecture Notes in Computer Science, 3340, pp. 368-380
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.
Description: This is a journal article. It was published in Lecture notes in computer science [© Springer Verlag] and the definitive version is available at: www.springerlink.com
URI: https://dspace.lboro.ac.uk/2134/3472
ISBN: 9783540240143
ISSN: 0302-9743
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
dlt04_reidenbach.pdf179.53 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.