Related papers: A polynomial-time algorithm for the automatic Bair…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
We describe the Amber tool for proving and refuting the termination of a class of probabilistic while-programs with polynomial arithmetic, in a fully automated manner. Amber combines martingale theory with properties of asymptotic bounding…
One says that a property $P$ of sets of natural numbers can be made into itself iff there is a numbering $\alpha_0,\alpha_1,\ldots$ of all left-r.e. sets such that the index set $\{e: \alpha_e$ satisfies $P\}$ has the property $P$ as well.…
We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…
We prove the following two results. 1. If $X$ is a completely regular space such that for every topological space $Y$ each separately continuous function $f:X\times Y\to\mathbb R$ is of the first Baire class, then every Lindel\"of subspace…
We give a general method to build categories of combinatorial manifolds, i.e. categories of combinatorial objects satisfying some local property at every "point", as coreflective subcategories of categories of relational presheaves. To do…
We prove that the category of ordered abelian groups equipped with an automorphism has the Amalgamation Property, deduce that their inductive theory is NIP in the sense of positive logic, and initiate a development of the latter framework.…
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…
The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…
We describe and implement a symbolic algebra for scalar and vector-valued finite elements, enabling the computer generation of elements with tensor product structure on quadrilateral, hexahedral and triangular prismatic cells. The algebra…
This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related to several models of computation: word automata, tree…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
A natural topology on the set of left orderings on free abelian groups and free groups $F_n$, $n>1$ has studied in [1]. It has been proven already that in the abelian case the resulted topological space is a Cantor set. There was a…
We show that, for every minimal action of a countably infinite discrete group on a compact metrizable space, if the extreme boundary of the simplex of invariant Borel probability measures is closed and has finite covering dimension then the…
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run, thereby preserving many of the desirable algorithmic properties of finite automata. Here, we study the…
We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…
The Kestelman-Borwein-Ditor Theorem asserts that a non-negligible subset of $\mathbb{R}$ which is Baire (=has the Baire property, BP) or measurable is shift-compact: it contains some subsequence of any null sequence to within translation by…
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…
The paper gives an example of a tree language G that is recognised by an unambiguous parity automaton and is analytic-complete as a set in Cantor space. This already shows that the unambiguous languages are topologically more complex than…