Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
1 result

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise

Lina Ye ; Igor Khmelnitsky ; Serge Haddad ; Benoît Barbot ; Benedikt Bollig ; Martin Leucker ; Daniel Neider ; Rajarshi Roy.
Angluin's L$^*$ algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by numerous random membership queries to get a high level&nbsp;[&hellip;]
Published on March 20, 2024
Volume 20, Issue 1
  • < Previous
  • 1
  • Next >