Counting minimal semi-Sturmian words (Q2446875): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Balanced sequences and optimal routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of finite Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal Sturmian partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for nonhomogeneous spectra of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterizations of finite Sturmian words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3831761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of factors of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal words with given subword complexity / rank
 
Normal rank

Latest revision as of 11:04, 8 July 2024

scientific article
Language Label Description Also known as
English
Counting minimal semi-Sturmian words
scientific article

    Statements