Learning Regular Languages with the TTT Algorithm
Summary
This article presents the TTT algorithm for active automata learning, combining discrimination trees with binary search to minimize membership queries. It includes definitions, data structures (DT and spanning trees), and incremental hypothesis updates with Python examples, contrasting TTT with L*. The post demonstrates end-to-end learning on multiple targets and discusses practical considerations.