Descriptive Set Theory and $\omega$-Powers of Finitary Languages - Archive ouverte HAL
Chapitre D'ouvrage Année : 2020

Descriptive Set Theory and $\omega$-Powers of Finitary Languages

Olivier Finkel
  • Fonction : Auteur
  • PersonId : 924907

Résumé

The ω-power of a finitary language L over a finite alphabet Σ is the language of infinite words over Σ defined by L ∞ := {w 0 w 1. .. ∈ Σ ω | ∀i ∈ ω w i ∈ L}. The ω-powers appear very naturally in Theoretical Computer Science in the characterization of several classes of languages of infinite words accepted by various kinds of automata, like Büchi automata or Büchi pushdown automata. We survey some recent results about the links relating Descriptive Set Theory and ω-powers.
Fichier principal
Vignette du fichier
DSTOPFL.pdf (197.25 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02898919 , version 1 (14-07-2020)

Identifiants

Citer

Olivier Finkel, Dominique Lecomte. Descriptive Set Theory and $\omega$-Powers of Finitary Languages. Adrian Rezus. Contemporary Logic and Computing, 1, College Publications, pp.518-541, 2020, Landscapes in Logic. ⟨hal-02898919⟩
54 Consultations
101 Téléchargements

Altmetric

Partager

More