Topological Complexity of Context-Free omega-Languages: A Survey

Details Topological Complexity of Context-Free omega-Languages: A Survey Topological Complexity of Context-Free omega-Languages: A Survey

2008-06-09

arxiv.org/abs/0806.1413v1

Computer Science

Logic in Computer Science

Scientific paper

We survey recent results on the topological complexity of context-free omega-languages which form the second level of the Chomsky hierarchy of languages of infinite words. In particular, we consider the Borel hierarchy and the Wadge hierarchy of non-deterministic or deterministic context-free omega-languages. We study also decision problems, the links with the notions of ambiguity and of degrees of ambiguity, and the special case of omega-powers.

Affiliated with

Also associated with

No associations

Rating

Topological Complexity of Context-Free omega-Languages: A Survey 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 Topological Complexity of Context-Free omega-Languages: A Survey, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological Complexity of Context-Free omega-Languages: A Survey will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400606