Related papers: String attractors and bi-infinite words
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
Dense distributions of string-like objects in material media are considered in terms of continuum field theory. The strings are assumed to carry a quantized abelian topological charge, such as the Burgers vector of dislocations in solids or…
The structure of the physical and strange attractors is inherently associated with the boundedness of fluctuations. The idea behind the boundedness is that a stable long-term evolution of any natural and engineered system is possible if and…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we introduce the joint string complexity as the cardinality of a set of words that are common to both strings.…
Symmetry transformations of the space-time fields of string theory are generated by certain similarity transformations of the stress-tensor of the associated conformal field theories. This observation is complicated by the fact that, as we…
The problem of storing a set of strings --- a string dictionary --- in compact form appears naturally in many cases. While classically it has represented a small part of the whole data to be processed (e.g., for Natural Language processing…
Linguistic similarity is multi-faceted. For instance, two words may be similar with respect to semantics, syntax, or morphology inter alia. Continuous word-embeddings have been shown to capture most of these shades of similarity to some…
We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various…
String theory has not even come close to a complete formulation after half a century of intense research. On the other hand, a number of features of the theory suggest that the theory, once completed, may be a final theory. It is argued in…
In these lectures we give a brief introduction to perturbative and non-perturbative string theory. The outline is the following: 1. Introduction to perturbative string theory 1.1 From point particle to extended objects 1.2 Free closed and…
Combinatorial properties of maximal repetitions (runs) in formal words are studied. We classify all maximal repetitions in a word as primary and secondary where the set of all primary repetitions determines all the other repetitons in the…
To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same…
We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…
We introduce the concept of associativity for string functions, where a string function is a unary operation on the set of strings over a given alphabet. We discuss this new property and describe certain classes of associative string…
This paper studies balance properties for billiard words. Billiard words generalize Sturmian words by coding trajectories in hypercubic billiards. In the setting of aperiodic order, they also provide the simplest examples of quasicrystals,…
Global random attractors and random point attractors for random dynamical systems have been studied for several decades. Here we introduce two intermediate concepts: $\Delta$-attractors are characterized by attracting all deterministic…
An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finite Lyndon words as prefixes. A characterization of binary…