20 citations · 59 across the 20 of their papers we have counts for
4 papers · 1 filter
Linear Combinations of Unordered Data Vectors
Piotr Hofman, Jérôme Leroux, Patrick Totzke
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite…
Bounding Average-energy Games
Patricia Bouyer, Piotr Hofman, Nicolas Markey +2
We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, de…
Simulation Problems Over One-Counter Nets
Piotr Hofman, Slawomir Lasota, Richard Mayr +1
One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1…
Complexity of regular abstractions of one-counter languages
Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman +3
We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA)…