Abstract
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.
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 callDisclaimer: 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.
