Angluin's L* algorithm synthesizes the unique minimal DFA for a regular language using membership and equivalence queries. Closed and consistent observation tables define candidate DFAs, converging in polynomial queries.