Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Tag-systems for the ...
Article

Tag-systems for the Hilbert curve

Patrice Séébold
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2007
Last modified on
March 31, 2025
Volume 9
vol. 9:2
DOI
10.46298/dmtcs.416
Indicators
575
Views
800
Downloads

Tag-systems for the Hilbert curve

Patrice Séébold
Abstract
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
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Peano curves
  • Hilbert curve
  • Hilbert words
  • tag-systems
  • D0L-systems
  • cubes
  • repetition-free words
Cited by

Source: OpenCitations

  • Amendable automaton for the language of finite strings of rectangular hilbert curve

    Journal of Discrete Mathematical Sciences and Cryptography

    Authors : K. Thiagarajan, P. Balasubramanian ORCID, K. Navaneetham, S. Brahnam ORCID

    Journal reference : Volume 22, 2019, pp. 1129-1140

    DOI : 10.1080/09720529.2019.1689611
Preview
Loading PDF preview...