| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421034 | Discrete Applied Mathematics | 2006 | 15 Pages |
Abstract
In this paper, extended graph splicing systems are defined. It is shown that when strings are represented as linear graphs, any recursively enumerable set can be generated by an extended graph splicing system. It is also shown that the computational completeness of extended graph splicing systems can be proved under some constraints too.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Rahul Santhanam, Kamala Krithivasan,