Automatic Learning of Subclasses of Pattern Languages

Automatic classes are classes of languages for which a finite automaton can decide membership question for the languages in the class, in a uniform way, given an index for the language. For alphabet size of at least 4, every automatic class of erasing pattern languages is contained, for some constan...

Full description

Saved in:
Bibliographic Details
Published inLanguage and Automata Theory and Applications pp. 192 - 203
Main Authors Case, John, Jain, Sanjay, Le, Trong Dao, Ong, Yuh Shin, Semukhin, Pavel, Stephan, Frank
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2011
SeriesLecture Notes in Computer Science
Subjects
Inductive Inference
Iterative Learning
Regular Language
Target Language
Term Memory
Online AccessGet full text

Cover

More Information
Summary:Automatic classes are classes of languages for which a finite automaton can decide membership question for the languages in the class, in a uniform way, given an index for the language. For alphabet size of at least 4, every automatic class of erasing pattern languages is contained, for some constant n, in the class of all languages generated by patterns which contain (1) every variable only once and (2) at most n symbols after the first occurrence of a variable. It is shown that such a class is automatically learnable using a learner with long-term memory bounded by the length of the first example seen. The study is extended to show the learnability of related classes such as the class of unions of two pattern languages of the above type.
ISBN:9783642212536
3642212530
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-21254-3_14