A complete characterization of repetitive morphisms over the two-letter alphabet

Synchronizing delay for binary uniform morphisms

“…We state a proof here as it is quite simple using the results from [7]. However, a complete characterisation of repetitive (and so non-circular) D0L-systems with binary morphisms was done in [8]. Partial characterisation of circular D0L-systems with a binary k-uniform morphism was also given in [9,10].…”