A non-learnable class of E-pattern languages

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...

Full description

Saved in:
Bibliographic Details
Main Author: Daniel Reidenbach
Format: Default Article
Published: 2006
Subjects:
Other information and computing sciences not elsewhere classified
Pattern languages
Inductive inference
Learning theory
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/3463
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items