No CrossRef data available.
Article contents
Polypodic codes
Published online by Cambridge University Press: 15 December 2002
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2002
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.