A new bound for the D0L sequence equivalence problem (Q855272): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00236-006-0028-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1980241523
@@ Property / OpenAlex ID: W1980241523 / rank @@
+Normal rank
@@ Property / cites work @@
+The decidability of the equivalence problem for DOL-systems
+Normal rank
@@ Property / cites work @@
+Elementary homomorphisms and a solution of the DOL sequence equivalence problem
+Normal rank
@@ Property / cites work @@
+On a bound for the DOL sequence equivalence problem
+Normal rank
@@ Property / cites work @@
+A short solution for the HDT0L sequence equivalence problem
+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 @@
+An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
+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 @@
+Q4746787
@@ Property / cites work: Q4746787 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3753495
@@ Property / cites work: Q3753495 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit test sets for iterated morphisms in free monoids and metabelian groups
+Normal rank