Cancellation and periodicity properties of iterated morphisms



: Honkala J

Publisher: ELSEVIER SCIENCE BV

: 2008

: Theoretical Computer Science

: THEORETICAL COMPUTER SCIENCE

: THEOR COMPUT SCI

: 391

: 1-2

: 61

: 64

: 4

: 0304-3975

DOI: https://doi.org/10.1016/j.tcs.2007.10.030


In this note we prove two cancellation properties of iterated morphisms and use these properties to give a simple method for deciding whether or not a given infinite D0L word is ultimately periodic. (C) 2007 Elsevier B.V. All rights reserved.



Last updated on 2024-26-11 at 18:53