The equality problem for infinite words generated by primitive morphisms (Q2389351): Difference between revisions

@@ Property / cites work @@
+Automatic Sequences
@@ Property / cites work: Automatic Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+The ω sequence problem for DOL systems is decidable
+Normal rank
@@ Property / cites work @@
+A bound for the<i>ω</i>-equivalence problem of polynomial D0L systems
+Normal rank
@@ Property / cites work @@
+An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
+Normal rank
@@ Property / cites work @@
+A new bound for the D0L sequence equivalence problem
+Normal rank
@@ Property / cites work @@
+THE D0L ω-EQUIVALENCE PROBLEM
@@ Property / cites work: THE D0L ω-EQUIVALENCE PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+The sequence equivalence problem for primitive D0L systems
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4140407
@@ Property / cites work: Q4140407 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank