Results 81 to 90 of about 593 (116)

Sturmian words with balanced construction [Elektronisk resurs]

open access: yes, 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  

On a combinatorial property of Sturmian words

open access: yesTheoretical Computer Science, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacques Justin, Giuseppe Pirillo
openaire   +2 more sources

Formal Intercept of Sturmian words

open access: yes, 2018
We give a combinatorial definition of the second parameter describing Sturmian words, that we call formal intercept, as an infinite Ostrowski expansion.
Wojcik, Caïus
core   +3 more sources

Some characterizations of finite Sturmian words

open access: yes, 2006
In this paper, we give some new characterizations of words which are finite factors of Sturmian words. An enumeration formula for primitive finite Sturmian words is given. Moreover, we provide two linear-time algorithms to recognize whether a finite word
Alessandro De Luca   +4 more
core   +1 more source

Language Structure of Pattern Sturmian Words

open access: yes, 2008
Pattern Sturmian words introduced by Kamae and Zamboni [KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two kinds of recurrent pattern Sturmian words are known, namely, rotation words
Hui Rao   +3 more
core  

Lyndon words and singular factors of Sturmian words

open access: yesTheoretical Computer Science, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Recent Results on Extensions of Sturmian Words

open access: yes, 2001
Sturmian words are in nite words over a two-letter alphabet that admit a great number of equivalent de nitions. Most of them have been given in the past ten years.
Jean Berstel, Berstel, Jean
core  

Home - About - Disclaimer - Privacy