Multiple splicing systems and the universal computability

Authors:
Satoshi KobayashI;Yasubumi Sakakibara
Affiliations:
Tokyo Denki University, Saitama, Japan;Tokyo Denki University, Saitama, Japan
Venue:
Theoretical Computer Science
Year:
2001

Citing 9
Cited 1

Computation and automata

Computation and automata
Prefix grammars: an alternative characterization of the regular languages

Information Processing Letters
Molecular computation of solutions to combinatorial problems

Science
Regularity of splicing languages

Discrete Applied Mathematics
On the splicing operation

Discrete Applied Mathematics
Computing by splicing

Theoretical Computer Science - Special issue on universal machines and computations
Regular extended H systems are computationally universal

Journal of Automata, Languages and Combinatorics
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination

Handbook of formal languages, vol. 2
DNA Computing: Distributed Splicing Systems

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht

Molecular computing paradigm – toward freedom from Turing's charm

Natural Computing: an international journal

Quantified Score

Hi-index	5.23

Visualization

Abstract

We propose a new extension of splicing systems, called multiple splicing systems, based on a kind of logic grammars. First, we introduce a class of Elementary formal systems, called simple H-form EFS, and show that its generative power is equivalent to the class of basic splicing systems (the original Head's splicing system) and is more adequate as representation device for formal languages. Next, we gradually extend the simple class of EFSs and get a very natural extension of splicing systems, multiple splicing systems. We show that multiple splicing systems have universal computability.