Topological Complexity of Locally Finite omega-Languages - ENS de Lyon - École normale supérieure de Lyon Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

Topological Complexity of Locally Finite omega-Languages

Résumé

Locally finite omega-languages were introduced by Ressayre in [Formal Languages defined by the Underlying Structure of their Words, Journal of Symbolic Logic, 53 (4), December 1988, p. 1009-1026]. These languages are defined by local sentences and extend omega-languages accepted by Büchi automata or defined by monadic second order sentences. We investigate their topological complexity. All locally finite omega languages are analytic sets, the class LOC_omega of locally finite omega-languages meets all finite levels of the Borel hierarchy and there exist some locally finite omega-languages which are Borel sets of infinite rank or even analytic but non-Borel sets. This gives partial answers to questions of Simonnet [Automates et Théorie Descriptive, Ph. D. Thesis, Université Paris 7, March 1992] and of Duparc, Finkel, and Ressayre [Computer Science and the Fine Structure of Borel Sets, Theoretical Computer Science, Volume 257 (1-2), 2001, p.85-105].
Fichier principal
Vignette du fichier
LOC-AML.pdf (268.5 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

ensl-00160798 , version 1 (08-07-2007)
ensl-00160798 , version 2 (10-07-2007)

Identifiants

  • HAL Id : ensl-00160798 , version 1

Citer

Olivier Finkel. Topological Complexity of Locally Finite omega-Languages. 2007. ⟨ensl-00160798v1⟩
97 Consultations
153 Téléchargements

Partager

Gmail Facebook X LinkedIn More