2010 | OriginalPaper | Chapter
CGE: A Sequential Learning Algorithm for Mealy Automata
Author : Karl Meinke
Published in: Grammatical Inference: Theoretical Results and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We introduce a new algorithm for sequential learning of Mealy automata by
congruence generator extension
(CGE). Our approach makes use of techniques from term rewriting theory and universal algebra for compactly representing and manipulating automata using finite congruence generator sets represented as
string rewriting systems
(SRS). We prove that the CGE algorithm correctly learns in the limit.