On Infinite Real Trace Rational Languages of Maximum Topological Complexity

Details On Infinite Real Trace Rational Languages of Maximum Topological Complexity On Infinite Real Trace Rational Languages of Maximum Topological Complexity

2008-01-03

arxiv.org/abs/0801.0537v1

Zapiski Nauchnyh Seminarov POMI 316 (2004) 205-223

Computer Science

Logic in Computer Science

Scientific paper

We consider the set of infinite real traces, over a dependence alphabet (Gamma, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real traces are analytic sets and that there exist some rational languages of infinite real traces which are analytic but non Borel sets, and even Sigma^1_1-complete, hence of maximum possible topological complexity.

Affiliated with

Also associated with

No associations

Rating

On Infinite Real Trace Rational Languages of Maximum Topological Complexity 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 Infinite Real Trace Rational Languages of Maximum Topological Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Infinite Real Trace Rational Languages of Maximum Topological Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611260