CGE: A sequential learning algorithm for mealy automata
2010 (English)In: Grammatical Inference: Theoretical Results and Applications 10th International Colloquium, ICGI 2010, Valencia, Spain, September 13-16, 2010. Proceedings / [ed] José M. Sempere and Pedro García, 2010, 148-162 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
2010. 148-162 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 6339
Generator sets, Sequential learning, Sequential learning algorithm, String rewriting, Term rewriting, Universal algebra
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-62889DOI: 10.1007/978-3-642-15488-1_13ISI: 000312462500013ScopusID: 2-s2.0-78149252077ISBN: 978-364215487-4OAI: oai:DiVA.org:kth-62889DiVA: diva2:481294
10th International Colloquium on Grammatical Inference, ICGI 2010; Valencia; 13 September 2010 through 16 September 2010
QC 201201242012-01-202012-01-202013-12-19Bibliographically approved