An omega-power of a context-free language which is Borel above Delta^0_omega

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in the Proceedings of the International Conference Foundations of the Formal Sciences V : Infinite Games, November 2

Scientific paper

We use erasers-like basic operations on words to construct a set that is both
Borel and above Delta^0_omega, built as a set V^\omega where V is a language of
finite words accepted by a pushdown automaton. In particular, this gives a
first example of an omega-power of a context free language which is a Borel set
of infinite rank.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An omega-power of a context-free language which is Borel above Delta^0_omega 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 context-free language which is Borel above Delta^0_omega, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An omega-power of a context-free language which is Borel above Delta^0_omega will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-548003

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.