Splicing on Trees: the Iterated Case
| dc.creator | Rahonis,George | |
| dc.date | 1999 | |
| dc.date.accessioned | 2024-02-06T12:50:13Z | |
| dc.date.available | 2024-02-06T12:50:13Z | |
| dc.description | 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. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-005-09-0599 | |
| dc.identifier | https://lib.jucs.org/article/27596/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7619 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 5(9): 599-609 | |
| dc.subject | DNA computing | |
| dc.subject | trees languages | |
| dc.title | Splicing on Trees: the Iterated Case | |
| dc.type | Research Article |