reidenbach_stacs04.pdf (196.05 kB)
A discontinuity in pattern inference
journal contributionposted on 2008-07-10, 07:29 authored by Daniel Reidenbach
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.
- Computer Science
CitationREIDENBACH, D., 2004. A discontinuity in pattern inference. Lecture Notes in Computer Science, 2996, pp. 129-140
NotesThis 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