Deterministic asynchronous automata for infinite traces

Extended abstract
  • Volker Diekert
  • Anca Muscholl
Conference paper

DOI: 10.1007/3-540-56503-5_61

Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)
Cite this paper as:
Diekert V., Muscholl A. (1993) Deterministic asynchronous automata for infinite traces. In: Enjalbert P., Finkel A., Wagner K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Volker Diekert
    • 1
  • Anca Muscholl
    • 1
  1. 1.Institut für InformatikUniversität StuttgartStuttgart 80

Personalised recommendations