Results 81 to 90 of about 1,318,046 (112)
ECEM 2017: Abstracts, August, 20th to 24th, 2017, University of Wuppertal, Germany, Edited by Ralph Radach, Heiner Deubel, Christian Vorstius & Markus J. Hofmann. [PDF]
J Eye Mov Res, 2017 europepmc +1 more source
Words derivated from Sturmian words [PDF]
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Araújo, Isabel M., Bruyère, Véronique
exaly +8 more sources
Rich, Sturmian, and trapezoidal words [PDF]
Theoretical Computer Science, 2008 In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced in arXiv:0801.1656 by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite words characterized by having the maximal number of palindromic factors.
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 Sturmian sequences, which can be defined as codings of irrational rotations on the unit circle, and morphic sequences, which are obtained by taking the pointwise image of iterative fixed points of morphims of the free monoid, are two families of ``simple'' sequences, in the sense that they are somehow ``close'' (in distinct ways) to periodic sequences.
Patrice Séébold, Séébold, Patrice
exaly +3 more sources
Quasiperiodic Sturmian words and morphisms [PDF]
Theoretical Computer Science, 2007 We characterize all quasiperiodic Sturmian words: a Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.
Florence Levé, Gwénaël Richomme
exaly +4 more sources
Palindromes and Sturmian words
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giuseppe Pirillo
exaly +2 more sources
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences, 2014 A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word.
Gabriele Fici
exaly +5 more sources