5 citations · 8 across the 2 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2023
Analyzing Robustness of Angluin's L Algorithm in Presence of Noise
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…
cs.FL2022★ 3 cited
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise
Igor Khmelnitsky, Serge Haddad, Lina Ye +5
Angluin's L* algorithm learns the minimal (complete) deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approxim…