Automata and semigroups recognizing infinite words - Archive ouverte HAL
Chapitre D'ouvrage Année : 2007

Automata and semigroups recognizing infinite words

Résumé

This paper is a survey on the algebraic approach to the theory of automata accepting infinite words. We discuss the various acceptance modes (Büchi automata, Muller automata, transition automata, weak recognition by a finite semigroup, omega-semigroups) and prove their equivalence. We also give two algebraic proofs of McNaughton's theorem on the equivalence between Büchi and Muller automata. Finally, we present some recent work on prophetic automata and discuss its extension to transfinite words.
Fichier principal
Vignette du fichier
OmegaSem.pdf (293.81 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00340797 , version 1 (22-11-2008)

Identifiants

  • HAL Id : hal-00340797 , version 1

Citer

Olivier Carton, Dominique Perrin, Jean-Eric Pin. Automata and semigroups recognizing infinite words. J. Flum, E. Grädel and T. Wilke. Logic and Automata, History and perspectives, Amsterdam University Press, pp.585-596, 2007. ⟨hal-00340797⟩
439 Consultations
497 Téléchargements

Partager

More