Learning Regular Languages with L* Algorithm
TLDR; This tutorial is a complete implementation of Angluin’s L-star algorithm
with PAC learning for inferring input grammars of blackbox programs in Python
(i.e. without using equivalence queries). Such grammars are typically useful
for fuzzing such programs.
The Python interpreter is embedded so that you
can work through the implementation steps.
In many previous posts, I have discussed how to
parse with,
fuzz with, and
manipulate regular and context-free grammars. However, in many cases, such...
Read more at rahul.gopinath.org