56 citations · 105 across the 22 of their papers we have counts for
27 papers
Layered automata: A canonical model for automata over infinite words
Antonio Casares, Christof Löding, Igor Walukiewicz
We introduce layered automata, a subclass of alternating parity automata that generalises deterministic automata. Assuming a consistency property, these automata are history determ…
A Hyperlogic for Strategies in Stochastic Games (Extended Version)
Lina Gerlach, Christof Löding, Erika Ábrahám
We propose a probabilistic hyperlogic called HyperSt that can express hyperproperties of strategies in turn-based stochastic games. To the best of our knowledge, HyperSt is…
Minimal History-Deterministic Co-Büchi Automata: Congruences and Passive Learning
Christof Löding, Igor Walukiewicz
Abu Radi and Kupferman (2019) demonstrated the efficient minimization of history-deterministic (transition-based) co-Büchi automata, building on the results of Kuperberg and Skrzyp…
Finite-valued Streaming String Transducers
Emmanuel Filiot, Ismaël Jecker, Christof Löding +3
A transducer is finite-valued if for some bound k, it maps any given input to at most k outputs. For classical, one-way transducers, it is known since the 80s that finite valuednes…
On the Boolean Closure of Deterministic Top-Down Tree Automata
Christof Löding, Wolfgang Thomas
The class of Boolean combinations of tree languages recognized by deterministic top-down tree automata (also known as deterministic root-to-frontier automata) is studied. The probl…
Constructing Deterministic Parity Automata from Positive and Negative Examples
León Bohn, Christof Löding
We present a polynomial time algorithm that constructs a deterministic parity automaton (DPA) from a given set of positive and negative ultimately periodic example words. We show t…