arXiv 0803.18412008-03-12cs.LOcs.CCmath.LO

On the Topological Complexity of Infinitary Rational Relations

Olivier Finkel

发表信息：: RAIRO-Theoretical Informatics and Applications 37 (2) (2003) 105-113

英文摘要：

We prove in this paper that there exists some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [Automates et Théorie Descriptive, Ph. D. Thesis, Université Paris 7, March 1992].

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

An Example of Pi^0_3-complete Infinitary Rational Relation

We give in this paper an example of infinitary rational relation, accepted by a 2-tape Büchi automaton, which is Pi^0_3-complete in the Borel hierarchy. Moreover the example of infinitary rational relation given in this paper has a very simple structure and can be easily described by its sections.

2007-02-12cs.CCcs.LOmath.LO

On Infinitary Rational Relations and Borel Sets

We prove in this paper that there exists some infinitary rational relations which are Sigma^0_3-complete Borel sets and some others which are Pi^0_3-complete. This implies that there exists some infinitary rational relations which are Delta^0_4-sets but not (Sigma^0_3U Pi^0_3)-sets. These results give additional answers to questions of Simonnet and of Lescow and Thomas.

2010-05-31cs.CCcs.LOmath.LO

Wadge Degrees of Infinitary Rational Relations

We show that, from the topological point of view, 2-tape Büchi automata have the same accepting power as Turing machines equipped with a Büchi acceptance condition. The Borel and the Wadge hierarchies of the class RAT_omega of infinitary rational relations accepted by 2-tape Büchi automata are equal to the Borel and the Wadge hierarchies of omega-languages accepted by real-time Büchi 1-counter automata or by Büchi Turing machines. In particular, for every non-null recursive ordinal $α$, there exist some $Σ^0_α$-complete and some $Π^0_α$-complete infinitary rational relations. And the supremum …

2008-04-21cs.CCcs.LOmath.LO

Highly Undecidable Problems For Infinite Computations

We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $Π_2^1$-complete, hence located at the second level of the analytical hierarchy, and "highly undecidable". In particular, the universality problem, the inclusion problem, the equivalence problem, the determinizability problem, the complementability problem, and the unambiguity problem are all $Π_2^1$-complete for context-free omega-languages or for infinitary rational relations. Topological and arithmetical properties of 1-counter omega-languages, c…

2009-01-04cs.CCcs.LOmath.LO

Finitary Corecursion for the Infinitary Lambda Calculus

Kurz et al. have recently shown that infinite $λ$-trees with finitely many free variables modulo $α$-equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigate the rational fixpoint of that functor. We prove that it is formed by all rational $λ$-trees, i.e. those $λ$-trees which have only finitely many subtrees (up to isomorphism). This yields a corecursion principle that allows the definition of operations such as substitution on rational $λ$-trees.

2015-05-29cs.LOmath.CT

Some Problems in Automata Theory Which Depend on the Models of Set Theory

We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an omega-language $L(A)$ accepted by a Büchi 1-counter automaton $A$. We prove the following surprising result: there exists a 1-counter Büchi automaton $A$ such that the cardinality of the complement $L(A)^-$ of the omega-language $L(A)$ is not determined by ZFC: (1). There is a model $V_1$ of ZFC in which $L(A)^-$ is countable. (2). There is a model $V_2$ of ZFC in which $L(A…

2011-08-14cs.CCcs.FLcs.LO

更多相关论文收起更多论文

The Complexity of Infinite Computations In Models of Set Theory

We prove the following surprising result: there exist a 1-counter Büchi automaton and a 2-tape Büchi automaton such that the ω-language of the first and the infinitary rational relation of the second in one model of ZFC are π_2^0-sets, while in a different model of ZFC both are analytic but non Borel sets. This shows that the topological complexity of an ω-language accepted by a 1-counter Büchi automaton or of an infinitary rational relation accepted by a 2-tape Büchi automaton is not determined by the axiomatic system ZFC. We show that a similar result holds for the class of languages of infi…

2009-12-23cs.CCcs.LOmath.LO

Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular omega-Language

It was noticed by Harel in [Har86] that "one can define $Σ_1^1$-complete versions of the well-known Post Correspondence Problem". We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a regular $ω$-language is $Σ_1^1$-complete, hence located beyond the arithmetical hierarchy and highly undecidable. We infer from this result that it is $Π_1^1$-complete to determine whether two given infinitary rational relations are disjoint. Then we prove that there is an amazing gap between two decision problems about $ω$-rational functions realized by finite …

2011-07-29cs.CCcs.LOmath.LO

On Infinite Real Trace Rational Languages of Maximum Topological Complexity

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.

2008-01-03cs.LOmath.LO