Related papers: Simplicity and irreducibility in circular automata
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we…
Affine finite automata (AfA) can be more succinct than probabilistic and quantum finite automata when recognizing some regular languages with bounded-error. In this paper, we improve previously known constructions given for the succinctness…
Suppose $\alpha$ is an orientation-preserving diffeomorphism (shift) of $\mR_+=(0,\infty)$ onto itself with the only fixed points $0$ and $\infty$. In \cite{KKLsufficiency} we found sufficient conditions for the Fredholmness of the singular…
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for…
Hybrid automata are a natural framework for modeling and analyzing systems which exhibit a mixed discrete continuous behaviour. However, the standard operational semantics defined over such models implicitly assume perfect knowledge of the…
The aim of this paper is to give a simpler, more usable sufficient condition to the regularity of generic weakly stationary time series. Also, this condition is used to show how regular processes satisfying these sufficient conditions can…
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on…
It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-called finite range condition plays a prominent role. We show…
In this paper, we deal with the notions of naturality from category theory and definablity from model theory and their interactions. In this regard, we present three results. First, we show, under some mild conditions, that naturality…
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target location within T time units, where T is a constant rational…
Given a monoid $(M,\varepsilon,\cdot )$ it is shown that a subset $A\subseteq M$ is recognizable in the sense of automata theory if and only if the $\varphi $-rank of $x=x$ is zero in the first-order theory $\operatorname{Th}(M,\varepsilon…
In this paper, we shall prove that the irreducibility in the sense of fine topology implies the uniqueness of invariant probability measures. It is also proven that this irreducibility is strictly weaker than the strong Feller property plus…
We exhibit rationally ergodic, weakly mixing measure preserving transformations which are not subsequence rationally weakly mixing and give a condition for smoothness of renewal sequences.
This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many…
We prove an explicit condition on the level $k$ for the irreducibility of a vacuum module $V^{k}$ over a (non-twisted) affine Lie superalgebra, which was conjectured by M. Gorelik and V.G. Kac. An immediate consequence of this work is the…
We study the replica free energy surface for a spin glass model near the glassy temperature. In this model the simplicity of the equilibrium solution hides non trivial metastable saddle points. By means of the stability analysis performed…
Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible. The problem of checking whether there…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…
We construct a probabilistic finite automaton (PFA) with 7 states and an input alphabet of 5 symbols for which the PFA Emptiness Problem is undecidable. The only input for the decision problem is the starting distribution. For the proof, we…