Sciweavers

Share
CORR
2010
Springer

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

9 years 4 days ago
On Omega Context Free Languages which are Borel Sets of Infinite Rank
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Volume 262 (1-2), 2001, p. 669697] that the class of -CFL exhausts the finite ranks of the Borel hierarchy, and in [Borel Hierarchy and Omega Context Free Languages, Theoretical Computer Science, to appear] that there exist some -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" (J. W. de Bakker et al., eds), Springer LNCS 803 (1994), 583-621]. Key words: omega context free languages; topological properties; Borel hierarchy. Contents
Olivier Finkel
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Olivier Finkel
Comments (0)
books