| Issue |
RAIRO-Theor. Inf. Appl.
Volume 36, Number 1, January/March 2002
|
|
|---|---|---|
| Page(s) | 5 - 28 | |
| DOI | https://doi.org/10.1051/ita:2002002 | |
| Published online | 15 December 2002 | |
Polypodic codes
1
Department of Mathematics, Aristotle University of Thessaloniki,
54006 Thessaloniki, Greece.
2
Posidonos 7, Nea Krini, 55132 Thessaloniki, Greece.
Received:
23
February
2001
Accepted:
27
May
2002
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.
Mathematics Subject Classification: 68R05 / 05C90
Key words: Code / polypode / trees.
© EDP Sciences, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.