Related papers: String attractors and bi-infinite words
We introduce the category of finite strings and study its basic properties. The category is closely related to the augmented simplex category, and it models categories of linear representations. Each lattice of non-crossing partitions…
The random map model is a deterministic dynamical system in a finite phase space with n points. The map that establishes the dynamics of the system is constructed by randomly choosing, for every point, another one as being its image. We…
We introduce the notion of $\alpha$-numbers and formal intercept of sturmian words, and derive from this study general factorisations formula for sturmian words. Sturmian words are defined as infinite words with lowest unbound complexity,…
While the large majority of theoretical and numerical studies of the jamming transition consider athermal packings of purely repulsive spheres, real complex fluids and soft solids generically display attraction between particles. By…
Extended Alexander groups are used to define an invariant for open virtual strings. Examples of non-commuting open strings and a ribbon-concordance obstruction are given. An example is given of a slice virtual open string that is not…
Frobenius observed that the number of times an element of a finite group is obtained as a commutator is given by a specific combination of the irreducible characters of the group. More generally, for any word w the number of times an…
Recently the strings and the string number of self-maps were used in the computation of the algebraic entropy of special group endomorphisms. We introduce two special kinds of strings, and their relative string numbers. We show that a…
Acoustics-to-word models are end-to-end speech recognizers that use words as targets without relying on pronunciation dictionaries or graphemes. These models are notoriously difficult to train due to the lack of linguistic knowledge. It is…
Piecewise Translations is a class of dynamical systems which arises from some applications in computer science, machine learning, and electrical engineering. In dimension 1 it can also be viewed as a non-invertible generalization of…
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. It was conjectured that in each completely…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…
We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism…
This essay presents a critical evaluation of the concepts of string theory and its impact on particle physics. The point of departure is a historical review of four decades of ST within the broader context of six decades of failed attempts…
We study a finite uni-directional array of "cascading" or "threshold coupled" chaotic maps. Such systems have been proposed for use in nonlinear computing and have been applied to classification problems in bioinformatics. We describe some…
We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word. The characterization leads to a…
We consider a class of conformal models describing closed strings in axially symmetric stationary magnetic flux tube backgrounds. These models are closed string analogs of the Landau model of a particle in a magnetic field or the model of…
We construct an open set of endomorphisms of an arbitrary two-dimensional manifold which have attractors and non-wandering sets with non-invariant interior. This is a notable contrast to the properties of diffeomorphisms, where the interior…
This paper classifies binary morphisms that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).
We study infinite string modules that are bricks over some gentle algebras. In particular, we first give a complete classification of these modules over the double-Kronecker gentle algebra and prove that each family is in bijection with a…
Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…