5 citations · 5 across the 6 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026
Visibly Recursive Automata
Kévin Dubrulle, Véronique Bruyère, Guillermo A. Pérez +1
As an alternative to visibly pushdown automata, we introduce visibly recursive automata (VRAs), composed of a set of classical automata that can call each other. VRAs are a strict…
cs.FL2024★ 5 cited
Active Learning of Mealy Machines with Timers
Véronique Bruyère, Bharat Garhewal, Guillermo A. Pérez +2
We present the first algorithm for query learning Mealy machines with timers in a black-box context. Our algorithm is an extension of the L# algorithm of Vaandrager et al. to a tim…