15 citations · 37 across the 12 of their papers we have counts for
Showing 2017 · cs.FLShow all
2 papers · 2 filters
cs.FL2017
Two Recursively Inseparable Problems for Probabilistic Automata
Nathanaël Fijalkow, Hugo Gimbert, Florian Horn +1
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is s…
cs.FL2017★ 1 cited
Trading Bounds for Memory in Games with Counters
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg +1
We study two-player games with counters, where the objective of the first player is that the counter values remain bounded. We investigate the existence of a trade-off between the…