26 citations · 68 across the 9 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.FL2023★ 1 cited
Feasability of Learning Weighted Automata on a Semiring
Laure Daviaud, Marianne Johnson
Since the seminal work by Angluin and the introduction of the L*-algorithm, active learning of automata by membership and equivalence queries has been extensively studied to learn…
cs.FL2023
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
Laure Daviaud, David Purser, Marie Tcheng
We show that the big-O problem for max-plus automata is decidable and PSPACE-complete. The big-O (or affine domination) problem asks whether, given two max-plus automata computing…