Polypodic codes
Symeon Bozapalidis; Olympia Louscou–Bozapalidou
RAIRO - Theoretical Informatics and Applications (2010)
- Volume: 36, Issue: 1, page 5-28
- ISSN: 0988-3754
Access Full Article
topAbstract
topHow to cite
topReferences
top- S. Bozapalidis, An Introduction 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).
- K. Menger, Super Associative Systems and Logical Functions. Math. Ann.157 (1964) 278-295.
- S. Mantaci and A. Restivo, Tree Codes and Equations, in Proc. of the 3rd 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.