On infinite HD0L words having sparse letters




Honkala J

PublisherTAYLOR & FRANCIS LTD

2004

International Journal of Computer Mathematics

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS

INT J COMPUT MATH

81

2

133

139

7

0020-7160

DOIhttps://doi.org/10.1080/00207160310001650125



We discuss the equality problem for infinite words generated by HD0L systems having sparse letters.



Last updated on 2024-26-11 at 23:11