A short solution of the HDT0L sequence equivalence problem
Theoretical Computer Science
Handbook of Formal Languages
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Explicit test sets for iterated morphisms in free monoids and metabelian groups
Theoretical Computer Science - Insightful theory
An n 2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet
Journal of Computer and System Sciences
A new bound for the D0L sequence equivalence problem
Acta Informatica
| Hi-index | 0.00 |
The D0L sequence equivalence problem consists of deciding, given two morphisms g:X^@?-X^@?, h:X^@?-X^@? and a word w@?X^@?, whether or not g^i(w)=h^i(w) for all i=0. We show that in case of primitive morphisms, to decide the D0L sequence equivalence problem, it suffices to consider the terms of the sequences with i