Abstract

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 gi(w)=hi(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<7n3nlogn, where n is the cardinality of X. A smaller bound is obtained for primitive looping morphisms.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.