1 citations · 3 across the 5 of their papers we have counts for
10 papers
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann +4
In the Intersection Non-Emptiness problem, we are given a list of finite automata over a common alphabet as input, and the goal is to determine whether some…
Decomposing Permutation Automata
Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf
A deterministic finite automaton (DFA) is composite if its language can be decomposed into an intersection of languages of smaller DFAs. Otherwise, A is prime. This notion of prima…
A Ramsey Theorem for Finite Monoids
Ismaël Jecker
Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid , it is natural to ask how long a…
Infinite-Duration All-Pay Bidding Games
Guy Avni, Ismaël Jecker, Đorđe Žikelić
In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the p…
The Complexity of Transducer Synthesis from Multi-Sequential Specifications
Léo Exibard, Emmanuel Filiot, Ismaël Jecker
The transducer synthesis problem on finite words asks, given a specification , where and are sets of finite words, whether there exists an implement…
Beyond admissibility: Dominance between chains of strategies
Nicolas Basset, Ismaël Jecker, Arno Pauly +2
Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical rationality notion in game theory. In many classes of games this is justified by resul…