{"docId":416,"paperId":416,"url":"https:\/\/dmtcs.episciences.org\/416","doi":"10.46298\/dmtcs.416","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":82,"name":"Vol. 9 no. 2"}],"section":[],"repositoryName":"Hal","repositoryIdentifier":"lirmm-00184092","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/lirmm-00184092v1","dateSubmitted":"2015-03-26 16:19:46","dateAccepted":"2015-06-09 14:46:44","datePublished":"2007-01-01 08:00:00","titles":{"en":"Tag-systems for the Hilbert curve"},"authors":["S\u00e9\u00e9bold, Patrice"],"abstracts":{"en":"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."},"keywords":[["Peano curves"],["Hilbert curve"],["Hilbert words"],["tag-systems"],["D0L-systems"],["cubes"],["repetition-free words"],"[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]"]}