38 citations · 61 across the 2 of their papers we have counts for
2 papers
cs.LO2011★ 38 cited
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
Patricia Bouyer, Nicolas Markey, Jörg Olschewski +1
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the…
cs.FL2010★ 23 cited
The Complexity of Finding Reset Words in Finite Automata
Jörg Olschewski, Michael Ummels
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha…