1 citations · 2 across the 5 of their papers we have counts for
5 papers
Characterizing the Polynomial-Time Minimizable -Automata
Bader Abu Radi, Rüdiger Ehlers
A central question in the theory of automata is which classes of automata can be minimized in polynomial time. We close the remaining gaps for deterministic and history-determinist…
Rerailing Automata
Rüdiger Ehlers
In this paper, we introduce rerailing automata for -regular languages. They generalize both deterministic parity (DPW) and minimized history-deterministic co-Büchi automata (wit…
From LTL to COCOA without Detours
Rüdiger Ehlers, Ayrat Khalimov
Chains of co-Büchi automata (COCOA) have recently been introduced as a new canonical representation of omega-regular languages. The co-Büchi automata in a chain assign each omega-w…
Fully Generalized Reactivity(1) Synthesis
Rüdiger Ehlers, Ayrat Khalimov
Generalized Reactivity(1) (GR(1)) synthesis is a reactive synthesis approach in which the specification is split into two parts: a symbolic game graph, describing the safe transiti…
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…