Results 1 to 10 of about 593 (116)
Words derivated from Sturmian words
Theoretical Computer Science, 2005 A return word of a factor of a Sturmian word starts at an occurrence of that factor and ends exactly before its next occurrence. Derivated words encode the unique decomposition of a word in terms of return words.
Véronique Bruyere
exaly +6 more sources
Rich, Sturmian, and trapezoidal words
Theoretical Computer Science, 2008 In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite
Aldo De Luca, Amy Glen, Luca Q Zamboni
exaly +7 more sources
Sturmian images of non Sturmian words and standard morphisms
Theoretical Computer Science, 2018 International audienceWe prove that if a Sturmian word is the image by a morphism of a word which is a fixed point of another morphism, then this latter word is mostly a Sturmian word, and the involved morphisms are Sturmian.
Patrice Séébold, Séébold, Patrice
exaly +3 more sources
Sturmian morphisms and α-words
Theoretical Computer Science, 1999 In this paper we prove that the set W of α-words over {0,1} coincides with the set of images of 0 under Sturmian morphisms. This gives an alternative approach of generating α-words.
Chuan Wai-Fong, Wai-Fong, Chuan
exaly +3 more sources
Language structure of pattern Sturmian words
Discrete Mathematics, 2006 Pattern Sturmian words introduced by Kamae and Zamboni [Sequence entropy and the maximal pattern complexity of infinite words, Ergodic Theory Dynamical Systems 22 (2002) 1191–1199; Maximal pattern complexity for discrete systems, Ergodic Theory Dynamical
Teturo Kamae, Hui Rao, Bo Tan
exaly +2 more sources
Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science, 2007 International audienceWe characterize all quasiperiodic Sturmian words: a Sturmian word is not quasiperiodic if and only if it is a Lyndon word.
Levé, Florence, Richomme, Gwenaël
exaly +1 more source
Words and morphisms with Sturmian erasures
Bulletin of the Belgian Mathematical Society - Simon Stevin, 2004 International audienceWe say $x \in \{ 0,1,2 \}^{\NN}$ is a word with Sturmian erasures if for any $a\in \{ 0,1,2 \}$ the word obtained erasing all $a$ in $x$ is a Sturmian word.
Fabien Durand
exaly +3 more sources
Bifix codes and Sturmian words
Journal of Algebra, 2012 International audienceWe prove new results concerning the relation between bifix codes, episturmian words and subgroups of free groups. We study bifix codes in factorial sets of words.
Jean Berstel +2 more
exaly +3 more sources
Test-words for Sturmian morphisms
Bulletin of the Belgian Mathematical Society - Simon Stevin, 1999 International audienceJ. Berstel and P. Séébold have proved that an acyclic morphism f is Sturmian iff the word f(baabaababaabab) is balanced. More precisely, they have given a set \Omega of test-words for Sturmian morphisms.
Richomme, Gwenaël
exaly +2 more sources
A Ramsey characterisation of eventually periodic words
Bulletin of the London Mathematical Society, Volume 54, Issue 6, Page 2437-2455, December 2022., 2022 Abstract A factorisation x=u1u2⋯$x = u_1 u_2 \cdots$ of an infinite word x$x$ on alphabet X$X$ is called ‘monochromatic’, for a given colouring of the finite words X∗$X^*$ on alphabet X$X$, if each ui$u_i$ is the same colour. Wojcik and Zamboni proved that the word x$x$ is periodic if and only if for every finite colouring of X∗$X^*$ there is a ...
Maria‐Romina Ivan +2 more
wiley +1 more source