8 citations · 16 across the 15 of their papers we have counts for
4 papers · 1 filter
Bidding Graph Games with Partially-Observable Budgets
Guy Avni, Ismael Jecker, Djordje Zikelic
Two-player zero-sum "graph games" are a central model, which proceeds as follows. A token is placed on a vertex of a graph, and the two players move it to produce an infinite "play…
History-deterministic Parikh Automata
Enzo Erlich, Mario Grobler, Shibashis Guha +3
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run. Thereby, they preserve many of the desirable…
Parikh Automata over Infinite Words
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen +1
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run, thereby preserving many of the desirable alg…
A Regular and Complete Notion of Delay for Streaming String Transducers
Emmanuel Filiot, Ismaël Jecker, Christof Löding +1
The notion of delay between finite transducers is a core element of numerous fundamental results of transducer theory. The goal of this work is to provide a similar notion for more…