JUCS - Journal of Universal Computer Science 5(9): 599-609, doi: 10.3217/jucs-005-09-0599
Splicing on Trees: the Iterated Case
expand article infoGeorge Rahonis
‡ 30 Kyprou st. 57019 Perea, Thessaloniki, Greece
Open Access
The closure under the splicing operation with finite and recognizable sets of rules, is extended to the family of generalized synchronized forests. Moreover, we investigate the application of the iterated splicing on known families of forests. Interesting properties of this operation are established.
DNA computing, trees languages