5 citations · 10 across the 9 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
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…
cs.LO2022★ 1 cited
On the Existential Fragments of Local First-Order Logics with Data
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfi…