A remark on morphic sturmian words
From MaRDI portal
Publication:4365012
DOI10.1051/ita/1994283-402551zbMath0883.68104MaRDI QIDQ4365012
Publication date: 16 March 1998
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92479
Related Items
Decimations and sturmian words, Some algorithms to compute the conjugates of Episturmian morphisms, Episturmian words: a survey, On substitution invariant Sturmian words: an application of Rauzy fractals, Episturmian words and some constructions of de Luca and Rauzy, Infinite permutations of lowest maximal pattern complexity, Palindromic complexity of codings of rotations, Occurrences of palindromes in characteristic Sturmian words, Farey codes and languages, Complexity of cutting words on regular tilings, The structure of subword graphs and suffix trees of Fibonacci words, On stabilizers of infinite words, On \(\theta\)-episturmian words, Computation of words satisfying the ``rhythmic oddity property (after Simha Arom's works), On the conjugation of standard morphisms, On the subword equivalence problem for morphic words, Uniform tag systems for paperfolding sequences, \(\alpha\)-words and factors of characteristic sequences, Invariance properties of Sturmian words, Sturmian words: structure, combinatorics, and their arithmetics, Sturmian words, Lyndon words and trees, Standard Sturmian morphisms, On the factors of automatic words, Conjugacy and episturmian morphisms., Additive and multiplicative properties of point sets based on beta-integers., Harmonic and gold Sturmian words, Conjugates of characteristic Sturmian words generated by morphisms, Palindromes and Sturmian words, Sturmian morphisms and \(\alpha\)-words, Compressed string-matching in standard Sturmian words, Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm, Characteristic morphisms of generalized episturmian words, A geometrical characterization of factors of multidimensional billiard words and some applications, On the arithmetical complexity of Sturmian words, Powers in a class of \(\mathcal A\)-strict standard episturmian words, On periodicity and low complexity of infinite permutations, Characterizations of finite and infinite episturmian words via lexicographic orderings, On an involution of Christoffel words and Sturmian morphisms, Codes of central Sturmian words, Palindromic factors of billiard words, Some characterizations of finite Sturmian words., Pseudopalindrome closure operators in free monoids, Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture, A little more about morphic Sturmian words, Sequences of low arithmetical complexity, Look and Say Fibonacci, On a Family of Morphic Images of Arnoux-Rauzy Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On infinite words obtained by iterating morphisms
- Splicing semigroups of dominoes and DNA
- Rational and affine expressions for image description
- Certain words on the real projective line
- Substitution invariant cutting sequences
- Sturmian morphisms and Rauzy's rules
- \(L\)-systems and mutually recursive function systems
- Parametrized recurrent systems for image generation
- Some combinatorial properties of Sturmian words
- ENCODING IMAGES AS WORDS AND LANGUAGES
- WHICH DISTRIBUTIONS OF MATTER DIFFRACT ? AN INITIAL INVESTIGATION
- Descriptions of the Characteristic Sequence of an Irrational
- ITERATIVE DEVICES GENERATING INFINITE WORDS
- Sequences with minimal block growth
