On the arithmetical complexity of Sturmian words (Q2373754): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2007.03.022
+Normal rank
@@ Property / OpenAlex ID @@
+W2021349402
@@ Property / OpenAlex ID: W2021349402 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences of low arithmetical complexity
@@ Property / cites work: Sequences of low arithmetical complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on morphic sturmian words
@@ Property / cites work: A remark on morphic sturmian words / rank @@
+Normal rank
@@ Property / cites work @@
+A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
+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 @@
+A lower bound for the arithmetical complexity of Sturmian words
+Normal rank
@@ Property / cites work @@
+Arithmetical complexity of symmetric D0L words.
@@ Property / cites work: Arithmetical complexity of symmetric D0L words. / rank @@
+Normal rank
@@ Property / cites work @@
+On possible growths of arithmetical complexity
@@ Property / cites work: On possible growths of arithmetical complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences of linear arithmetical complexity
@@ Property / cites work: Sequences of linear arithmetical complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Sequence entropy and the maximal pattern complexity of infinite words
+Normal rank
@@ Property / cites work @@
+*-Sturmian words and complexity
@@ Property / cites work: *-Sturmian words and complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4738292
@@ Property / cites work: Q4738292 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequences with subword complexity \(2n\)
@@ Property / cites work: Sequences with subword complexity \(2n\) / rank @@
+Normal rank