The subword complexity of a class of infinite binary words (Q2370831): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aam.2006.04.001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The number of factors in a paperfolding sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of infinite sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Représentation géométrique de suites de complexité $2n+1$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of sequences defined by billiard in the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of trajectories in rectangular billiards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Billiard complexity in rational polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and special factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of sequences and dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with subword complexity \(2n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subword complexity of a generalized Thue-Morse word / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AAM.2006.04.001 / rank
 
Normal rank

Latest revision as of 06:15, 18 December 2024

scientific article
Language Label Description Also known as
English
The subword complexity of a class of infinite binary words
scientific article

    Statements

    Identifiers