Related papers: An Example of Pi^0_3-complete Infinitary Rational …

We introduce a certain restriction of weighted automata over the rationals, called image-binary automata. We show that such automata accept the regular languages, can be exponentially more succinct than corresponding NFAs, and allow for…

We prove that $\omega$-regular languages accepted by B\"uchi or Muller automata satisfy an effective automata-theoretic version of the Baire property. Then we use this result to obtain a new effective property of rational functions over…

We prove that, for any natural number n $\ge$ 1, we can find a finite alphabet $\Sigma$ and a finitary language L over $\Sigma$ accepted by a one-counter automaton, such that the $\omega$-power L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$…

Let $X$ be an uncountable Polish space and let $\mathcal{I}$ be an ideal on $\omega$. A point $\eta \in X$ is an $\mathcal{I}$-limit point of a sequence $(x_n)$ taking values in $X$ if there exists a subsequence $(x_{k_n})$ convergent to…

In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb{Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a…

Let $\Phi$ be a finite crystallographic irreducible root system and $\mathcal P_{\Phi}$ be the convex hull of the roots in $\Phi$. We give a uniform explicit description of the polytope $\mathcal P_{\Phi}$, analyze the…

We associate a rational number $\chi(\mathcal{A})$ to every category $\mathcal{A}$ whose object and morphism sets are finite. We show that the assignment $\chi$ is additive under disjoint union and it preserves products. Hence we consider…

We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad. The first part of the paper is devoted to presenting a construction of a monad…

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate…

Altenbernd, Thomas and W\"ohrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the B\"uchi and Muller ones,…

We develop general machinery to cast the class of potential canonical Scott sentences of an infinitary sentence $\Phi$ as a class of structures in a related language. From this, we show that $\Phi$ has a Borel complete expansion if and only…

Let $b\ge 2$ be an integer. We show that the set of real numbers that are Poisson generic in base $b$ is $\boldsymbol{\Pi}^0_3$-complete in the Borel hierarchy of subsets of the real line. Furthermore, the set of real numbers that are Borel…

We discuss the decomposability of torsion-free abelian groups. We show that among computable groups of finite rank this property is $\Sigma^0_3$-complete. However, when we consider groups of infinite rank, it becomes $\Sigma^1_1$-complete,…

We study the links between the topological complexity of an omega context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set theory, we prove that non Borel omega context free…

Despite its success in producing numerous general results on state-based dynamics, the theory of coalgebra has struggled to accommodate the Buechi acceptance condition---a basic notion in the theory of automata for infinite words or trees.…

Infinite types and formulas are known to have really curious and unsound behaviors. For instance, they allow to type {\Omega}, the auto- autoapplication and they thus do not ensure any form of normalization/productivity. Moreover, in most…

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

In "A Hosse diagram for rational toral tanks," we see a CW complex ${\mathcal T}(X)$, which gives a rational homotopical classification of almost free toral actions on spaces in the rational homotopy type of $X$ associated with rational…

We study unirational algebraic varieties and the fields of rational functions on them. We show that after adding a finite number of variables some of these fields admit an infinitely transitive model. The latter is an algebraic variety with…