72 citations · 81 across the 6 of their papers we have counts for
1 paper · 1 filter
Lina Ye, Igor Khmelnitsky, Serge Haddad +5
Angluin's L∗ algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively…