tcs_reidenbach.pdf (230.36 kB)
A non-learnable class of E-pattern languages
journal contributionposted on 2008-07-03, 16:01 authored by Daniel Reidenbach
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.
- Computer Science
CitationREIDENBACH, D., 2006. A non-learnable class of E-pattern languages. Theoretical Computer Science, 350 (1), pp. 91-102
NotesThis 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