CGE: a sequential learning algorithm for Mealy automata

DOI10.1007/978-3-642-15488-1_13MaRDI QIDQ3588372zbMATH OpenOpenAlexFDO

Authors Karl Meinke

Publication date 10 September 2010

Published in Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15488-1_13

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Identification of automata by sequential learning
• Efficient learning of typical finite automata from random walks
• Universal automata and NFA learning
• Automata Learning: A Categorical Perspective
• CALF: categorical automata learning framework

Cited in

(4)

• Incremental learning-based testing for reactive systems
• A new approach for active automata learning based on apartness
• Learning communicating state machines
• Benchmarking combinations of learning and testing algorithms for automata learning

This page was built for publication: CGE: a sequential learning algorithm for Mealy automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588372)