AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2514
@@ Property / arXiv ID: 1005.2514 / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic Dynamics II. Sturmian Trajectories
@@ Property / cites work: Symbolic Dynamics II. Sturmian Trajectories / rank @@
+Normal rank
@@ Property / cites work @@
+Balance and abelian complexity of the Tribonacci word
+Normal rank
@@ Property / cites work @@
+Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words
+Normal rank
@@ Property / cites work @@
+On uniformly repetitive semigroups
@@ Property / cites work: On uniformly repetitive semigroups / rank @@
+Normal rank
@@ Property / cites work @@
+On nonrepetitive sequences
@@ Property / cites work: On nonrepetitive sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly non-repetitive sequences and progression-free sets
+Normal rank
@@ Property / cites work @@
+A Second Course in Formal Languages and Automata Theory
+Normal rank
@@ Property / cites work @@
+Balances for fixed points of primitive substitutions.
+Normal rank
@@ Property / cites work @@
+A characterization of substitutive sequences using return words
+Normal rank
@@ Property / cites work @@
+Cobham-Semenov theorem and \(\mathbb N^d\)-subshifts
+Normal rank
@@ Property / OpenAlex ID @@
+W2119013637
@@ Property / OpenAlex ID: W2119013637 / rank @@
+Normal rank