ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY
Volume 1, Number 4, 1998, 307 - 318

 

H Tree Schemes with Finite and Recognizable Sets of Rules

Symeon BOZAPALIDIS, George RAHONIS
Department of Mathematics, Aristotle University of Thessaloniki, Greece
E-mail: bozapali@ccf.auth.gr, rahonis@ccf.auth.gr

 

Abstract.
We introduce a new operation for splicing trees. We prove that sheaves of forests closed under a special type of an inverse tree homomorphism are also closed under splicing schemes with finite and recognizable sets of rules. Applications to known families of forests are given.