reidenbach_stacs04.pdf (196.05 kB)
Download fileA discontinuity in pattern inference
journal contribution
posted on 2008-07-10, 07:29 authored by Daniel ReidenbachThis 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.
History
School
- Science
Department
- Computer Science