Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties (Q2974059): Difference between revisions

@@ Property / cites work @@
+ON THE REPETITIVITY INDEX OF INFINITE WORDS
@@ Property / cites work: ON THE REPETITIVITY INDEX OF INFINITE WORDS / rank @@
+Normal rank
@@ Property / cites work @@
+On factors of synchronized sequences
@@ Property / cites work: On factors of synchronized sequences / rank @@
+Normal rank
@@ Property / cites work @@
+On synchronized sequences and their separators
@@ Property / cites work: On synchronized sequences and their separators / rank @@
+Normal rank
@@ Property / cites work @@
+ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for computing the repetitions in a word
+Normal rank
@@ Property / cites work @@
+The exact number of squares in Fibonacci words
@@ Property / cites work: The exact number of squares in Fibonacci words / rank @@
+Normal rank
@@ Property / cites work @@
+On the Number of Unbordered Factors
@@ Property / cites work: On the Number of Unbordered Factors / rank @@
+Normal rank
@@ Property / cites work @@
+Subword Complexity and k-Synchronization
@@ Property / cites work: Subword Complexity and k-Synchronization / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic Dynamics II. Sturmian Trajectories
@@ Property / cites work: Symbolic Dynamics II. Sturmian Trajectories / rank @@
+Normal rank