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

Title: A non-learnable class of E-pattern languages
Authors: Reidenbach, Daniel
Keywords: Pattern languages
Inductive inference
Learning theory
Issue Date: 2006
Publisher: © Elsevier
Citation: REIDENBACH, D., 2006. A non-learnable class of E-pattern languages. Theoretical Computer Science, 350 (1), pp. 91-102
Abstract: We investigate the inferrability of E-pattern languages (also known as extended or erasing pattern languages) from positive data in Gold’s learning model. As the main result, our analysis yields a negative outcome for the full class of E-pattern languages – and even for the subclass of terminal-free E-pattern languages – if the corresponding terminal alphabet consists of exactly two distinct letters. Furthermore, we present a positive result for a manifest subclass of terminal-free E-pattern languages. We point out that the considered problems are closely related to fundamental questions concerning the nondeterminism of E-pattern languages.
Description: This is a journal article. It was published in the journal, Theoretical Computer Science [© Elsevier]. The definitive version is available at: doi:10.1016/j.tcs.2005.10.017
URI: https://dspace.lboro.ac.uk/2134/3463
ISSN: 0304-3975
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
tcs_reidenbach.pdf230.36 kBAdobe PDFView/Open

 

SFX Query

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