An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank

Details An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank

2008-01-03

arxiv.org/abs/0801.0535v1

Fundamenta Informaticae 62 (3-4) (2004) 333-342

Computer Science

Logic in Computer Science

Scientific paper

Omega-powers of finitary languages are omega languages in the form V^omega, where V is a finitary language over a finite alphabet X. Since the set of infinite words over X can be equipped with the usual Cantor topology, the question of the topological complexity of omega-powers naturally arises and has been raised by Niwinski, by Simonnet, and by Staiger. It has been recently proved that for each integer n > 0, there exist some omega-powers of context free languages which are Pi^0_n-complete Borel sets, and that there exists a context free language L such that L^omega is analytic but not Borel. But the question was still open whether there exists a finitary language V such that V^omega is a Borel set of infinite rank. We answer this question in this paper, giving an example of a finitary language whose omega-power is Borel of infinite rank.

Affiliated with

Also associated with

No associations

Rating

An omega-Power of a Finitary Language Which is a Borel Set 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 An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611257