Computer Science – Computational Complexity
Scientific paper
2008-01-11
Dans Proceedings of the International Conference on Foundations of the Formal Sciences V : Infinite Games - Foundations of the
Computer Science
Computational Complexity
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.
Duparc Jacques
Finkel Olivier
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-548003