Accepting splicing systems

Authors:
Victor Mitrana;Ion Petre;Vladimir Rogojin
Affiliations:
Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania;Department of Information Technologies, bo Akademi University, ICT-building, Joukahaisenkatu 3-5 A, FIN-20520 Turku, Finland;Department of Information Technologies, bo Akademi University, ICT-building, Joukahaisenkatu 3-5 A, FIN-20520 Turku, Finland
Venue:
Theoretical Computer Science
Year:
2010

Citing 7
Cited 2

Splicing semigroups of dominoes and DNA

Discrete Mathematics
Regularity of splicing languages

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
Regular splicing languages and subclasses

Theoretical Computer Science - The art of theory
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA splicing: computing by observing

Natural Computing: an international journal

Splicing systems: accepting versus generating

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Accepting Networks of Genetic Processors are computationally complete

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we propose a novel approach to splicing systems, namely we consider them as accepting devices. Two ways of iterating the splicing operation and two variants of accepting splicing system are investigated. Altogether, we obtain four models, which are compared with each other as well as with the generating splicing systems from the computational power point of view. Several decision problems concerning the accepting splicing systems are discussed.