Hilbert words correspond to finite approximations of the Hilbert space filling curve. The Hilbert infinite word H is obtained as the limit of these words. It gives a description of the Hilbert (infinite) curve. We give a uniform tag-system to generate automatically H and, by showing that it is almost cube-free, we prove that it cannot be obtained by simply iterating a morphism.
On the hartmanis-stearns problem for a class of tag machines
1 Document citing this article
Source : OpenCitations
Thiagarajan, K.; Balasubramanian, P.; Navaneetham, K.; Brahnam, S., 2019, Amendable Automaton For The Language Of Finite Strings Of Rectangular Hilbert Curve, Journal Of Discrete Mathematical Sciences And Cryptography, 22, 6, pp. 1129-1140, 10.1080/09720529.2019.1689611.