Results 61 to 70 of about 593 (116)

Generalized balances in Sturmian words

Discrete Applied Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fagnot, Isabelle, Vuillon, Laurent
openaire   +2 more sources

A new characteristic property of rich words

, 2008
Originally introduced and studied by the third and fourth authors together with J. Justin and S. Widmer (2008), rich words constitute a new class of finite and infinite words characterized by containing the maximal number of distinct palindromes. Several
Zamboni, L., de Luca, Alessandro, Zamboni, Luca Q., De Luca, A., Glen, Amy, Zamboni, L.Q., Bucci, M., Bucci, Michelangelo, Glen, A.   +8 more
core   +1 more source

Generalized Natural Density DF⁡(Fk) of Fibonacci Word

Vestnik KRAUNC: Fiziko-Matematičeskie Nauki
This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, k-Fibonacci words, and their combinatorial properties.
Abdullah, D., Hamoud, J.
doaj   +1 more source

Words and Numbers: A Dynamical Systems Perspective

Axioms
Along 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

Sturmian and dendric words [PDF]

, 2023
This poster is a quick introduction to Sturmian words and to dendric words, one of their generalization.
Gheeraert, France
core  

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

Palindromic richness

, 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, Luca Q. Zamboni, Zamboni, Luca Q., Justin, J., Widmer, S, Jacques Justin, Widmer, Steve, Widmer, Steven, Amy Glen, Glen, Amy, Justin, Jacques, Steve Widmer, Glen, A.   +12 more
core   +1 more source

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, Guilhem Gamard, Anaël Grandjean   +2 more
openaire   +2 more sources

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  

The Number of Runs in Sturmian Words [PDF]

, 2008
Denote by the class of standard Sturmianwords. It is a class of highly compressible words extensively studied in combinatorics of words, including the well known Fibonacci words. The suffix automata for these words have a very particular structure.
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter   +2 more
openaire   +1 more source