Results 51 to 60 of about 1,318,046 (112)
Sturmian words and the Stern sequence
Theoretical Computer Science, 2015 Central, standard, and Christoffel words are three strongly interrelated classes of binary finite words which represent a finite counterpart of characteristic Sturmian words. A natural arithmetization of the theory is obtained by representing central and Christoffel words by irreducible fractions labeling respectively two binary trees, the Raney (or ...
DE LUCA, ALDO, DE LUCA, ALESSANDRO
openaire +5 more sources
A new characteristic property of rich words [PDF]
, 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. +12 more
core +1 more source
A Characterization of Sturmian Words by Return Words
European Journal of Combinatorics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Generalized balances in Sturmian words
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fagnot, Isabelle, Vuillon, Laurent
openaire +3 more sources
Sturmian words with balanced construction
, 2009 In this paper we define Sturmian words with balanced construction. We formulate a fixed-point theorem for Sturmian words and analyze the set of all fixed points.
Uscka-Wehlou, Hanna
core +2 more sources
Order and quasiperiodicity in episturmian words [PDF]
, 2007 We prove a refinement of a recent characterization of infinite episturmian words via lexicographic orderings (Glen-Justin-Pirillo, 2007). This allows us to easily characterize the strict episturmian words that are "infinite Lyndon words", i.e., those ...
Glen, A.
core
, 2018 The first print magazine from 1000 Words. 2018 marks the 10th anniversary of 1000 Words, and what better way to celebrate than to publish a special print annual?
Clark, Tim, 1000 Words
core +6 more sources
Generalized Natural Density DF(Fk) of Fibonacci Word
Vestnik KRAUNC: Fiziko-Matematičeskie NaukiThis 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
Sturmian words, β-shifts, and transcendence
Theoretical Computer Science, 2004 21 pages ...
Dong Pyo Chi, DoYong Kwon
openaire +2 more sources
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 +2 more
openaire +2 more sources