reidenbach_stacs04.pdf (196.05 kB)
0/0

A discontinuity in pattern inference

Download (196.05 kB)
journal contribution
posted on 10.07.2008 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.

History

School

  • Science

Department

  • Computer Science

Citation

REIDENBACH, D., 2004. A discontinuity in pattern inference. Lecture Notes in Computer Science, 2996, pp. 129-140

Publication date

2004

Notes

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

ISBN

9783540212362

ISSN

0302-9743;1611-3349

Language

en

Exports

Logo branding

Keyword(s)

Exports