2000 character limit reached
On Infinite Real Trace Rational Languages of Maximum Topological Complexity
Published 3 Jan 2008 in cs.LO and math.LO | (0801.0537v1)
Abstract: 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 Sigma1_1-complete, hence of maximum possible topological complexity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.