Studying graph - stability to apprehend relative hardness of constructive-non-constructive approximation
Sturm numbers and substitution invariance of 3iet words.
Sturmian jungle (or garden?) on multiliteral alphabets
The properties characterizing sturmian words are considered for words on multiliteral alphabets. We summarize various generalizations of sturmian words to multiliteral alphabets and enlarge the list of known relationships among these generalizations. We provide a new equivalent definition of rich words and make use of it in the study of generalizations of sturmian words based on palindromes. We also collect many examples of infinite words to illustrate differences in the generalized definitions...
Sturmian jungle (or garden?) on multiliteral alphabets
The properties characterizing Sturmian words are considered for words on multiliteral alphabets. We summarize various generalizations of Sturmian words to multiliteral alphabets and enlarge the list of known relationships among these generalizations. We provide a new equivalent definition of rich words and make use of it in the study of generalizations of Sturmian words based on palindromes. We also collect many examples of infinite words to illustrate differences in the generalized definitions...
Sturmian morphisms. (Morphismes de Sturm.)
Subalgebra bases and recognizable properties.
Subdivision Algorithms and the Kernel of a Polyhedron.
Subdivision of linear corner cutting curves.
Subdivisions de surfaces et cartes généralisées de dimension 2
Subjective surfaces and Riemannian mean curvature flow of graphs.
Sublogarithmic -space is not closed under complement and other separation results
Suboptimal feedback control of TCP flows in computer network using random early discard (RED) mechanism.
Suboptimal RED feedback control for buffered TCP flow dynamics in computer network.
Substitution invariant sturmian bisequences
We prove that a Sturmian bisequence, with slope and intercept , is fixed by some non-trivial substitution if and only if is a Sturm number and belongs to . We also detail a complementary system of integers connected with Beatty bisequences.
Substitution systems associated with the dynamical system (𝒜, Tf)*
We consider the dynamical system (𝒜, Tf), where 𝒜 is a class of differential real functions defined on some interval and Tf : 𝒜 → 𝒜 is an operator Tfφ := fοφ, where f is a differentiable m-modal map. If we consider functions in 𝒜 whose critical values are periodic points for f then, we show how to define and characterize a substitution system associated with (𝒜, Tf). For these substitution systems, we compute the growth rate of the...
Substitution up to isomorphism
Substitutions, abstract number systems and the space filling property
In this paper we study multi-dimensional words generated by fixed points of substitutions by projecting the integer points on the corresponding broken halfline. We show for a large class of substitutions that the resulting word is the restriction of a linear function modulo and that it can be decided whether the resulting word is space filling or not. The proof uses lattices and the abstract number system associated with the substitution.
Substitutions par des motifs en dimension 1
Une substitution est un morphisme de monoïdes libres : chaque lettre a pour image un mot, et l'image d'un mot est la concaténation des images de ses lettres. Cet article introduit une généralisation de la notion de substitution, où l'image d'une lettre n'est plus un mot mais un motif, c'est-à-dire un “mot à trous”, l'image d'un mot étant obtenue en raccordant les motifs correspondant à chacune de ses lettres à l'aide de règles locales. On caractérise complètement les substitutions par des motifs...
Substitutions with Cofinal Fixed Points
Let be a substitution over a 2-letter alphabet, say . If and begin with and respectively, has two fixed points beginning with and respectively.We characterize substitutions with two cofinal fixed points (i.e., which differ only by prefixes). The proof is a combinatorial one, based on the study of repetitions of words in the fixed points.
Subtree Matching by Pushdown Automata