Header menu link for other important links
X
Graph splicing systems
Kamala Krithivasan
Published in
2006
Volume: 154
   
Issue: 8
Pages: 1264 - 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. © 2006.
About the journal
JournalDiscrete Applied Mathematics
ISSN0166218X
Open AccessYes
Concepts (7)
  •  related image
    Computational methods
  •  related image
    Linear systems
  •  related image
    Recursive functions
  •  related image
    Computational completeness
  •  related image
    CONSTRAINED SPLICING SYSTEMS
  •  related image
    GRAPH SPLICING SYSTEMS
  •  related image
    Graph theory