Graph splicing systems

Authors:
Rahul Santhanam;Kamala Krithivasan
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Madras, India;Department of Computer Science and Engineering, Indian Institute of Technology, Madras, India
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 3
Cited 0

Regular extended H systems are computationally universal

Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Splicing systems on graphs

INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)

Quantified Score

Hi-index	0.04

Visualization

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.