Words whose complexity satisfies lim $\frac{p(n)}{n} = 1$. (Q1426035): Difference between revisions

@@ Property / cites work @@
+Examples of sequences of complexity less than \(2n\)
+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 @@
+Représentation géométrique de suites de complexité $2n+1$
+Normal rank
@@ Property / cites work @@
+Sturmian morphisms
@@ Property / cites work: Sturmian morphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences with minimal block growth
@@ Property / cites work: Sequences with minimal block growth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4784598
@@ Property / cites work: Q4784598 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal symbolic flows having minimal block growth
+Normal rank
@@ Property / cites work @@
+Q3338346
@@ Property / cites work: Q3338346 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences with subword complexity \(2n\)
@@ Property / cites work: Sequences with subword complexity \(2n\) / rank @@
+Normal rank

Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\). (Q1426035): Difference between revisions