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

@@ Property / cites work @@
+The number of factors in a paperfolding sequence
@@ Property / cites work: The number of factors in a paperfolding sequence / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of infinite sequences
@@ Property / cites work: On the complexity of infinite sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic Sequences
@@ Property / cites work: Automatic Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Représentation géométrique de suites de complexité $2n+1$
+Normal rank
@@ Property / cites work @@
+Complexity of sequences defined by billiard in the cube
+Normal rank
@@ Property / cites work @@
+Complexity of trajectories in rectangular billiards
+Normal rank
@@ Property / cites work @@
+Billiard complexity in rational polyhedra
@@ Property / cites work: Billiard complexity in rational polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and special factors
@@ Property / cites work: Complexity and special factors / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of sequences and dynamical systems
@@ Property / cites work: Complexity of sequences and dynamical systems / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences with subword complexity \(2n\)
@@ Property / cites work: Sequences with subword complexity \(2n\) / rank @@
+Normal rank
@@ Property / cites work @@
+Subword complexity of a generalized Thue-Morse word
+Normal rank