Results 61 to 70 of about 1,318,046 (112)
, 2008 In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense.
Zamboni, L +12 more
core +1 more source
Words and Numbers: A Dynamical Systems Perspective
AxiomsAlong with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of rationals from a dynamical systems point of view, somehow continuing along the path started in previous works of the first author ...
Stefano Isola, Francesco Marchionni
doaj +1 more source
Fractional powers in Sturmian words
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacques Justin, Giuseppe Pirillo
openaire +1 more source
A geometrical approach to Palindromic Factors of Standard Billiard Words
Discrete Mathematics & Theoretical Computer Science, 2007 Many results are already known, concerning the palindromic factors and the palindomic prefixes of Standard billiard words, i.e., Sturmian words and billiard words in any dimension, starting at the origin.
Jean-Pierre Borel
doaj
Quasiperiods of biinfinite Sturmian words
CoRR, 2018 We study the notion of quasiperiodicity, in the sense of "coverability", for biinfinite words. All previous work about quasiperiodicity focused on right infinite words, but the passage to the biinfinite case could help to prove stronger results about quasiperiods of Sturmian words.
Florian Barbero +2 more
openaire +2 more sources
On the arithmetical complexity of Sturmian words
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julien Cassaigne, Anna E. Frid
openaire +3 more sources
Modified complexity and $*$-Sturmian word
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1999 The authors introduce a new notion of complexity \(p^*\) for an infinite sequence over a finite alphabet. Instead of counting all the factors (blocks) of given length occurring in the sequence, they count all the blocks of given length that occur infinitely often in the sequence. Accordingly they define *-Sturmian words.
Nakashima, Izumi +2 more
openaire +3 more sources
Codes of central Sturmian words
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CARPI, Arturo, de Luca A.
openaire +6 more sources
Circular sturmian words and Hopcroft’s algorithm
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
RESTIVO, Antonio +2 more
openaire +2 more sources
On Infinite Prefix Normal Words. [PDF]
Theor Comput Sci, 2021 Cicalese F, Lipták Z, Rossi M.
europepmc +1 more source