The subword complexity of fixed points of binary uniform morphisms (Q5055933): Difference between revisions

@@ Property / author @@
-Anna E. Frid
@@ Property / author: Anna E. Frid / rank @@
-Normal rank
@@ Property / author @@
+Anna E. Frid
@@ Property / author: Anna E. Frid / rank @@
+Normal rank
@@ 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.1007/bfb0036182
+Normal rank
@@ Property / OpenAlex ID @@
+W1511597893
@@ Property / OpenAlex ID: W1511597893 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4852852
@@ Property / cites work: Q4852852 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of factors in the Thue-Morse word
@@ Property / cites work: Enumeration of factors in the Thue-Morse word / rank @@
+Normal rank
@@ Property / cites work @@
+Q5486009
@@ Property / cites work: Q5486009 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4345303
@@ Property / cites work: Q4345303 / rank @@
+Normal rank
@@ Property / cites work @@
+Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
+Normal rank
@@ Property / cites work @@
+If a DOL language is k-power free then it is circular
+Normal rank
@@ Property / cites work @@
+Power of words and recognizability of fixpoints of a substitution
+Normal rank
@@ Property / cites work @@
+Reconnaissabilité des substitutions et complexité des suites automatiques
+Normal rank
@@ Property / cites work @@
+Automata calculating the complexity of automatic sequences
+Normal rank