EQUALITY SETS OF MORPHIC WORD SEQUENCES (Q2841980): Difference between revisions

@@ Property / cites work @@
+The ultimate equivalence problem for DOL systems
@@ Property / cites work: The ultimate equivalence problem for DOL systems / rank @@
+Normal rank
@@ Property / cites work @@
+The decidability of the equivalence problem for DOL-systems
+Normal rank
@@ Property / cites work @@
+A Skolem-Mahler-Lech theorem in positive characteristic and finite automata
+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 @@
+On the equivalence problem for binary DOL systems
@@ Property / cites work: On the equivalence problem for binary DOL systems / rank @@
+Normal rank
@@ Property / cites work @@
+On some decidability problems for HDOL systems with nonsingular Parikh matrices
+Normal rank
@@ Property / cites work @@
+Explicit test sets for iterated morphisms in free monoids and metabelian groups
+Normal rank
@@ Property / cites work @@
+D0L sequence equivalence is in<i>P</i>for fixed alphabets
+Normal rank