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/3470

Title: On the learnability of E-pattern languages over small alphabets
Authors: Reidenbach, Daniel
Issue Date: 2004
Publisher: © Springer-Verlag
Citation: REIDENBACH, D., 2004. On the learnability of E-pattern languages over small alphabets. Lecture Notes in Computer Science, 3120, pp. 140-154
Abstract: This paper deals with two well discussed, but largely open problems on E-pattern languages, also known as extended or erasing pattern languages: primarily, the learnability in Gold’s learning model and, secondarily, the decidability of the equivalence. As the main result, we show that the full class of E-pattern languages is not inferrable from positive data if the corresponding terminal alphabet consists of exactly three or of exactly four letters – an insight that remarkably contrasts with the recent positive finding on the learnability of the subclass of terminal-free E-pattern languages for these alphabets. As a side-effect of our reasoning thereon, we reveal some particular example patterns that disprove a conjecture of Ohlebusch and Ukkonen (Theoretical Computer Science 186, 1997) on the decidability of the equivalence of E-pattern languages.
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/3470
ISBN: 9783540222828
ISSN: 0302-9743
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
colt04_reidenbach.pdf206.9 kBAdobe PDFView/Open


SFX Query

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