Rational series and their languages
Rational series and their languages
A short solution of the HDT0L sequence equivalence problem
Theoretical Computer Science
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Explicit test sets for iterated morphisms in free monoids and metabelian groups
Theoretical Computer Science - Insightful theory
| Hi-index | 5.23 |
We show that to test the equivalence of two D0L sequences over an n-letter alphabet generated by marked morphisms it suffices to compare the first 2n+1 initial terms of the sequences. Under an additional condition it is enough to consider the 2n initial terms.