Cyclic system for an algebraic theory of alternating parity automata

Anupam Das, Abhishek De

$\omega$-regular languages are a natural extension of the regular languages to the setting of infinite words. Likewise, they are recognised by a host of automata models, one of the most…