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

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

2010-05-31

arxiv.org/abs/1005.5633v1

Theoretical Computer Science 299 (1-3) (2003) 327-346

Computer Science

Logic in Computer Science

The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the first non-recursive ordina

Scientific paper

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].

Affiliated with

Also associated with

No associations

Rating

On Omega Context Free Languages which are Borel Sets of Infinite Rank does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Omega Context Free Languages which are Borel Sets of Infinite Rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Omega Context Free Languages which are Borel Sets of Infinite Rank will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627596