1 citations · 1 across the 5 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.FL2025
Efficient Learning of Weak Deterministic Büchi Automata
Mona Alluwayma, Yong Li, Sven Schewe +1
We present an efficient Angluin-style learning algorithm for weak deterministic Büchi automata (wDBAs). Different to ordinary deterministic Büchi and co-Büchi automata, wDBAs have…
cs.FL2025
Saturation Problems for Families of Automata
León Bohn, Yong Li, Christof Löding +1
Families of deterministic finite automata (FDFA) represent regular -languages through their ultimately periodic words (UP-words). An FDFA accepts pairs of words, where the first…