Semantic flowers for good-for-games and deterministic automata

We present an innovative approach for capturing the complexity of m-regular languages using the concept of flowers. This semantic tool combines two syntax-based definitions, namely the Mostowski hierarchy of word languages and syntactic flowers. The former is based on deterministic parity automata with a limited number of priorities, while the latter simplifies deterministic parity automata by reducing the number of priorities used, without altering their structure. Synthesising these two approaches yields a semantic concept of flowers, which offers a more effective way of dealing with the complexity of m-regular languages. This letter provides a comprehensive definition of semantic flowers and shows that it captures the complexity of m-regular languages. We also show that this natural concept yields simple proofs of the expressive power of good-for-games automata.