Graph splicing systems |
| |
| Authors: | Rahul Santhanam |
| |
| Institution: | Department of Computer Science and Engineering, Indian Institute of Technology, Madras, 600 036, India |
| |
| 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: | Extended graph splicing systems Computational completeness Constrained splicing systems |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
