Title of article
Graph splicing systems Original Research Article
Author/Authors
Rahul Santhanam، نويسنده , , Kamala Krithivasan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
15
From page
1264
To page
1278
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
Constrained splicing systems , Extended graph splicing systems , Computational completeness
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886276
Link To Document