Volume 665 of the series Lecture Notes in Computer Science pp 617-628


Deterministic asynchronous automata for infinite traces

Extended abstract
  • Volker DiekertAffiliated withInstitut für Informatik, Universität Stuttgart
  • , Anca MuschollAffiliated withInstitut für Informatik, Universität Stuttgart

* Final gross prices may vary according to local VAT.

Get Access


This paper shows the equivalence between the family of recognizable languages over infinite traces and deterministic asynchronous cellular Muller automata. We thus give a proper generalization of McNaughton's Theorem from infinite words to infinite traces. Thereby we solve one of the main open problems in this field. As a special case we obtain that every closed (w.r.t. the independence relation) word language is accepted by some I-diamond deterministic Muller automaton. We also determine the complexity of deciding whether a deterministic I-diamond Muller automaton accepts a closed language.