History-deterministic automata are an intermediate automata model, in between
deterministic and nondeterministic ones. An automaton is history-deterministic if its …

Nondeterminism models an ability to see the future: An automaton with an infinite look
ahead can successfully resolve its nondeterministic choices. An automaton is history …

In this paper, we look at good-for-games Rabin automata that recognise a Muller language
(a language that is entirely characterised by the set of letters that appear infinitely often in …

Automata models between determinism and nondeterminism/alternations can retain some of
the algorithmic properties of deterministic automata while enjoying some of the …

A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved
by only considering the prefix of the word read so far. Due to their good compositional …

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 …

We explore the notion of history-determinism in the context of timed automata (TA).
Historydeterministic automata are those in which nondeterminism can be resolved on the fly …

We show that the problem of checking if a given nondeterministic parity automaton simulates
another given nondeterministic parity automaton is NP-hard. We then adapt the techniques …

We consider the model of history-deterministic one-counter nets (OCNs). History-
determinism is a property of transition systems that allows for a limited kind of non …

We consider history-determinism, a restricted form of non-determinism, for Vector Addition
Systems with States (VASS) when used as acceptors to recognise languages of finite words …