Related papers: Small weakly universal Turing machines
In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the…
In this paper, we analyze the problem of finding the minimum dimension $n$ such that a closed-form analytic map/ordinary differential equation can simulate a Turing machine over $\mathbb{R}^{n}$ in a way that is robust to perturbations. We…
A catalytic Turing machine is a variant of a Turing machine in which there exists an auxiliary tape in addition to the input tape and the work tape. This auxiliary tape is initially filled with arbitrary content. The machine can read and…
A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration.…
We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain. The model is (semantically) a restriction of data automata, introduced by…
We present an infinite series of $n$-state Eulerian automata whose reset words have length at least $(n^2-3)/2$. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that…
Two permutations $(x_1,\dots,x_w)$ and $(y_1,\dots,y_w)$ are weakly similar if $x_i<x_{i+1}$ if and only if $y_i<y_{i+1}$ for all $1\leqslant i \leqslant w$. Let $\pi$ be a permutation of the set $[n]=\{1,2,\dots, n\}$ and let $wt(\pi)$…
In this paper, we construct a cellular automaton on the pentagrid which is planar, weakly universal and which have five states only. This result much improves the best result which was with nine states
In this paper, we construct a cellular automaton on the heptagrid which is planar, weakly universal and which have three states only. This result improves the best result which was with four states.
Simulations of weighted tree automata (wta) are considered. It is shown how such simulations can be decomposed into simpler functional and dual functional simulations also called forward and backward simulations. In addition, it is shown in…
We construct a two-dimensional Turing machine that is physically universal in both the moving tape and moving head model. In particular, it is mixing of all finite orders in both models. We also provide a variant that is physically…
In this paper, we prove that there is an outer totalistic weakly universal cellular automaton in the dodecagrid, the tessellation {5,3,4} of the hyperbolic 3D space, with four states. It is the first result in such a context.
Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs, providing a general notion of strong (weighted) bisimulation. In this paper we extend…
We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest…
We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines…
Weak memory models provide a complex, system-centric semantics for concurrent programs, while transactional memory (TM) provides a simpler, programmer-centric semantics. Both have been studied in detail, but their combined semantics is not…
Quantum weak measurements with states both pre- and postselected offer a window into a hitherto neglected sector of quantum mechanics. A class of such systems involves time dependent evolution with transitions possible. In this paper we…
We consider the problem of minimising the number of states in a multiplicity tree automaton over the field of rational numbers. We give a minimisation algorithm that runs in polynomial time assuming unit-cost arithmetic. We also show that a…
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not…
Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM), which can be used…