相关论文: A proof for the decidability of HD0L ultimate peri…
In this paper we prove 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…
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.
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 proof a uniqueness and periodicity theorem for bounded solutions of uniformly elliptic equations in certain unbounded domains.
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…
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).
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 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…
In this paper, we study the existence and uniqueness of periodic solutions of the differential equation of the form . Here, we obtain some sufficient conditions which guarantee the existence of periodic solutions. This equation is a quite…
In this manuscript we present a detailed proof for undecidability of the equivalence of finite substitutions on regular language $b\{0,1\}^*c$. The proof is based on the works of Leonid P. Lisovik.
We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.
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.
In this paper, we provide a necessary and sufficient condition ensuring the property of exponential dichotomy for periodic linear systems of generalized differential equations. This condition allow us to revisit a recent result of…
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…
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 give an arithmetic proof of rigidity for postcritically finite polynomials.