activity
20092024
most citedBüchi complementation made tight

31 citations · 242 across the 55 of their papers we have counts for

collaborators
Showing cs.FLShow all

17 papers · 1 filter

cs.FL2023

On the Succinctness of Good-for-MDPs Automata

Sven Schewe, Qiyi Tang

Good-for-MDPs and good-for-games automata are two recent classes of nondeterministic automata that reside between general nondeterministic and deterministic automata. Deterministic…

cs.FL2023

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…

cs.FL2023

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).…

cs.FL2023★ 1 cited

History-deterministic Timed Automata

Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen +2

We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism…

cs.FL2022

Natural Colors of Infinite Words

Rüdiger Ehlers, Sven Schewe

While finite automata have minimal DFAs as a simple and natural normal form, deterministic omega-automata do not currently have anything similar. One reason for this is that a norm…

cs.FL2022

Alternating Good-for-MDP Automata

Ernst Moritz Hahn, Mateo Perez, Sven Schewe +3

When omega-regular objectives were first proposed in model-free reinforcement learning (RL) for controlling MDPs, deterministic Rabin automata were used in an attempt to provide a…