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

Title: A discontinuity in pattern inference
Authors: Reidenbach, Daniel
Issue Date: 2004
Citation: REIDENBACH, D., 2004. A discontinuity in pattern inference. Lecture Notes in Computer Science, 2996, pp. 129-140
Abstract: This paper examines the learnability of a major subclass of E-pattern languages – also known as erasing or extended pattern languages – in Gold’s learning model: We show that the class of terminal-free E-pattern languages is inferrable from positive data if the corresponding terminal alphabet consists of three or more letters. Consequently, the recently presented negative result for binary alphabets is unique.
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/3475
ISBN: 9783540212362
ISSN: 0302-9743
1611-3349
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
reidenbach_stacs04.pdf196.05 kBAdobe PDFView/Open

 

SFX Query

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