相关论文: Multidimensional effective S-adic systems are sofi…

We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal…

An infinite word is S-automatic if, for all n>=0, its (n + 1)st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S. In this extended abstract, we consider an analogous…

We consider a topological space with its subbase which induces a coding for each point. Every second-countable Hausdorff space has a subbase that is the union of countably many pairs of disjoint open subsets. A dyadic subbase is such a…

We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive…

We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings,…

Let $K\subset \mathbb{R}$ be a self-similar set generated by some iterated function system. In this paper we prove, under some assumptions, that $K$ can be identified with a subshift of finite type. With this identification, we can…

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For…

It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually $\mathbb{Z}$ [DDPM15, CK15]. In this article we extend this result to a broader class proving that the…

Folding a sequence $S$ into a multidimensional box is a method that is used to construct multidimensional codes. The well known operation of folding is generalized in a way that the sequence $S$ can be folded into various shapes. The new…

A candidate for the effective 2-topos is proposed and shown to include the effective 1-topos as its subcategory of 0-types.

Plane-walking automata were introduced by Salo & T\"orma to recognise languages of two-dimensional infinite words (subshifts), the counterpart of $4$-way finite automata for two-dimensional finite words. We extend the model to allow for…

Stochastic port-Hamiltonian systems on infinite-dimensional spaces governed by It\^o stochastic differential equations (SDEs) are introduced and some properties of this new class of systems are studied. They are an extension of stochastic…

A switching dynamical system by means of piecewise linear systems in R^3 that presents multistability is presented. The flow of the system displays multiple scroll attractors due to the unstable hyperbolic focus-saddle equilibria with…

We prove that graph products of sofic groups are sofic, as are graphs of groups for which vertex groups are sofic and edge groups are amenable.

We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction. We show that some quasiperiodic…

In this note we apply a substantial improvement of a result of S. Ferenczi on $S$-adic subshifts to give Bratteli-Vershik representations of these subshifts.

We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…

An approach to find a weak form of shadowing is developed. We consider homeomorphisms of a compact metric space. It is proved that every pseudotrajectory with sufficiently small errors contains at least one subsequence that can be shadowed…

Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…