Active Automata Learning: from L * to L #
2021 Formal Methods in Computer Aided Design (FMCAD)（2021）
摘要
In this tutorial on active automata learning algorithms, I will start with the famous L* algorithm proposed by Dana Angluin in 1987, and explain how this algorithm approximates the Nerode congruence by means of refinement. Next, I will present a brief overview of the various improvements of the L* algorithm that have been proposed over the years. Finally, I will introduce L更多
查看译文
关键词
Approximation algorithms,Learning automata,Tutorials,Licenses,Focusing,Design automation
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要