Graph splicing systems

Rahul Santhanam, Kamala Krithivasan

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)1264-1278
Number of pages15
JournalDiscrete Applied Mathematics
Issue number8
Publication statusPublished - 2006


Dive into the research topics of 'Graph splicing systems'. Together they form a unique fingerprint.

Cite this