A discontinuity in pattern inference Daniel Reidenbach 2134/3475 https://repository.lboro.ac.uk/articles/journal_contribution/A_discontinuity_in_pattern_inference/9402305 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. 2008-07-10 07:29:26 untagged Information and Computing Sciences not elsewhere classified