On Omega Context Free Languages which are Borel Sets of Infinite Rank - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2003

On Omega Context Free Languages which are Borel Sets of Infinite Rank

Olivier Finkel
  • Fonction : Auteur
  • PersonId : 834645

Résumé

This paper is a continuation of the study of topological properties of omega context free languages (omega-CFL). We proved before that the class of omega-CFL exhausts the hierarchy of Borel sets of finite rank, and that there exist some omega-CFL which are analytic but non Borel sets. We prove here that there exist some omega context free languages which are Borel sets of infinite (but not finite) rank, giving additional answer to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:"A Decade of Concurrency", Springer LNCS 803 (1994), 583-621].
Fichier principal
Vignette du fichier
inf-Bor-cf.pdf (210.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00104196 , version 1 (06-10-2006)
hal-00104196 , version 2 (24-03-2010)

Identifiants

Citer

Olivier Finkel. On Omega Context Free Languages which are Borel Sets of Infinite Rank. Theoretical Computer Science, 2003, 299 (1-3), pp.327-346. ⟨hal-00104196v2⟩
82 Consultations
127 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More