Checking History-Determinism is NP-hard for Parity Automata
A Prakash - International Conference on Foundations of Software …, 2024 - Springer
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 …
another given nondeterministic parity automaton is NP-hard. We then adapt the techniques …
History-Determinism vs Fair Simulation
An automaton is history-deterministic if its nondeterminism can be resolved on the fly, only
using the prefix of the word read so far. This mild form of nondeterminism has attracted …
using the prefix of the word read so far. This mild form of nondeterminism has attracted …