20 citations · 24 across the 3 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2014★ 4 cited
Tight Bounds for Complementing Parity Automata
Sven Schewe, Thomas Varghese
We follow a connection between tight determinisation and complementation and establish a complementation procedure from parity automata to nondeterministic Büchi automata and prove…
cs.FL2014★ 20 cited
Determinising Parity Automata
Sven Schewe, Thomas Varghese
Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata throu…