|
Volumn 118, Issue , 2005, Pages 3-18
|
Insights to Angluin's Learning
|
Author keywords
Deterministic finite state automata; Learning algorithm; Prefix closed regular languages; Regular languages
|
Indexed keywords
APPROXIMATION THEORY;
FORMAL LANGUAGES;
LEARNING ALGORITHMS;
LEARNING SYSTEMS;
OPTIMIZATION;
PROBLEM SOLVING;
QUERY LANGUAGES;
RANDOM PROCESSES;
DETERMINISTIC FINITE STATE AUTOMATA;
MEMBERSHIP QUERIES;
MEMORY CONSUMPTION;
PREFIX CLOSED REGULAR LANGUAGES;
FINITE AUTOMATA;
|
EID: 13544255497
PISSN: 15710661
EISSN: None
Source Type: Journal
DOI: 10.1016/j.entcs.2004.12.015 Document Type: Conference Paper |
Times cited : (29)
|
References (12)
|