Graph splicing systems☆

https://doi.org/10.1016/j.dam.2005.12.005Get rights and content
Under an Elsevier user license
open archive

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

Cited by (0)

☆

This work was partially supported by a project from the Department of Science and Technology, Government of India.

Copyright © 2006 Published by Elsevier B.V.