2 citations · 2 across the 4 of their papers we have counts for
1 paper · 1 filter
Keya Prakash
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…