THE D0L ω-EQUIVALENCE PROBLEM (Q3426793): Difference between revisions

@@ Property / cites work @@
+On the decidability of the sequence equivalence problem for DOL-systems
+Normal rank
@@ Property / cites work @@
+The decidability of the equivalence problem for DOL-systems
+Normal rank
@@ Property / cites work @@
+The ω sequence problem for DOL systems is decidable
+Normal rank
@@ Property / cites work @@
+On infinite words obtained by iterating morphisms
@@ Property / cites work: On infinite words obtained by iterating morphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Elementary homomorphisms and a solution of the DOL sequence equivalence problem
+Normal rank
@@ Property / cites work @@
+A short solution for the HDT0L sequence equivalence problem
+Normal rank
@@ Property / cites work @@
+REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
@@ Property / cites work: REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
+Normal rank
@@ Property / cites work @@
+The class of HDT0L sequences is closed with respect to rational functions
+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 @@
+Q4746787
@@ Property / cites work: Q4746787 / rank @@
+Normal rank