22 citations · 31 across the 14 of their papers we have counts for
4 papers · 1 filter
A novel family of finite automata for recognizing and learning -regular languages
Yong Li, Sven Schewe, Qiyi Tang
Families of DFAs (FDFAs) have recently been introduced as a new representation of -regular languages. They target ultimately periodic words, with acceptors revolving around acce…
Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata
Yong Li, Sven Schewe, Moshe Y. Vardi
We introduce a method for translating an alternating weak Büchi automaton (AWA), which corresponds to a Linear Dynamic Logic (LDL) formula, to an unambiguous Büchi automaton (UBA).…
Model Checking Strategies from Synthesis Over Finite Traces
Suguman Bansal, Yong Li, Lucas Martinelli Tabajara +2
The innovations in reactive synthesis from {\em Linear Temporal Logics over finite traces} (LTLf) will be amplified by the ability to verify the correctness of the strategies gener…
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report)
Vojtěch Havlena, Ondřej Lengál, Yong Li +2
Complementation of nondeterministic Büchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis…