Related papers: Decidability of the HD0L ultimate periodicity prob…
We give a proof for the decidability of the HD0L ultimate periodicity problem.
We give a new proof for the decidability of the D0L ultimate periodicity problem based on the decidability of p-periodicity of morphic words adapted to the approach of Harju and Linna.
We prove that the problem of deciding whether a given morphic sequence is uniformly recurrent is decidable. The proof uses decidability of HD0L periodicity problem, which was recently proved in papers of F.Durand and I.Mitrofanov.
We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is…
In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system $\mathcal{H}_{DPL}$ is introduced for DPL and shown that it is weakly complete. Furthermore, this logic has…
We prove that any finite set $F\subset {\mathbb{Z}^2}$ that tiles ${\mathbb{Z}^2}$ by translations also admits a periodic tiling. As a consequence, the problem whether a given finite set $F$ tiles ${\mathbb{Z}^2}$ is decidable.
Mathematical formula describing the periodicity of the elements in the periodic system is presented.
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
We investigate the problem of deciding whether a system of linear equations, together with divisibility conditions on the variables, has a solution over holomorphy subrings of global fields. We obtain decidability results when we allow…
We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.
In this paper, we will consider a kind of infinite dimensional Hamiltonian system(HS), by the method of saddle point reduction, topology degree and the index, we will get the existence of periodic solution for (HS).
In this paper I would like to witness the mathematical inventiveness of G. Rauzy through personnal exchanges I had with him. The objects that will emerge will be used to treat the decidability of the HD 0 L $\omega$-equivalence and…
We study a one-dimensional ordinary differential equation modelling optical conveyor belts, showing in particular cases of physical interest that periodic solutions exist. Moreover, under rather general assumptions it is proved that the set…
The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly…
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…
In this paper, we consider the periodic tiling problem which was proved undecidable in the Euclidean plane by Yu. Gurevich and I. Koriakov in 1972. Here, we prove that the same problem for the hyperbolic plane is also undecidable.
In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].
This paper deals with the stability of linear periodic difference delay systems, where the value at time $t$ of a solution is a linear combination with periodic coefficients of its values at finitely many delayed instants…
We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…
An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.