Hostname: page-component-6766d58669-7cz98 Total loading time: 0 Render date: 2026-05-21T05:00:08.556Z Has data issue: false hasContentIssue false
  • English
  • Français

Polypodic codes

Published online by Cambridge University Press:  15 December 2002

Symeon Bozapalidis  and
Olympia Louscou–Bozapalidou
Symeon Bozapalidis
Affiliation:
Department of Mathematics, Aristotle University of Thessaloniki, 54006 Thessaloniki, Greece.
Olympia Louscou–Bozapalidou
Affiliation:
Posidonos 7, Nea Krini, 55132 Thessaloniki, Greece.
Get access

Abstract

Word and tree codes are studied in a common framework, that of polypodeswhich are sets endowed with a substitution like operation. Many examples aregiven and basic properties are examined. The code decomposition theorem isvalid in this general setup.

Keywords

Codepolypodetrees.

Information

Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 36 , Issue 1 , January 2002 , pp. 5 - 28
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Bozapalidis, S., Introduction, An to Polypodic Structures. J. Universal Comput. Sci. 5 (1999) 508-520.
J. Berstel and D. Perrin, Theory of Codes. Academic Press (1985).
B. Courcelle, Graph rewriting: An Algebraic and Logic Approach, edited by J. van Leeuwen. Elsevier, Amsterdam, Handb. Theoret. Comput. Sci. B (1990) 193-242.
F. Gécseg and M. Steinby, Tree Languages, edited by G. Rozenberg and A. Salomaa. Springer-Verlag, New York, Handb. Formal Lang. 3 , pp. 1-68.
V. Give'on, Algebraic Theory of m-automata, edited by Z. Kohavi and A. Paz. Academic Press, New York, Theory of Machines and Computation (1971) 275-286.
J. Engelfriet, Tree Automata and tree Grammars. DAIMI FN-10 (1975).
Menger, K., Super Associative Systems and Logical Functions. Math. Ann. 157 (1964) 278-295. CrossRef
S. Mantaci and A. Restivo, Tree Codes and Equations, in Proc. of the 3 rd International Conference DLT'97, edited by S. Bozapalidis. Thessaloniki (1998) 119-132.
M. Nivat, Binary Tree Codes. Tree Automata and Languages. Elsevier Science Publishers B.V. North Holland (1992) 1-19.