Regularity of splicing languages
Discrete Applied Mathematics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Splicing Systems, Aqueous Computing, and Beyond
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Splicing Systems: Regularity and Below
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Regular splicing languages and subclasses
Theoretical Computer Science - The art of theory
Splicing systems for universal turing machines
DNA'04 Proceedings of the 10th international conference on DNA computing
About Splicing P Systems with One Membrane
Fundamenta Informaticae
Complexity theory for splicing systems
Theoretical Computer Science
Non-preserving splicing with delay
International Journal of Computer Mathematics
Solving SAT and HPP with accepting splicing systems
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
| Hi-index | 5.23 |
In this paper, we propose a new definition of the language generated by a splicing system, motivated by both biochemical and mathematical considerations. The main feature of the new definition is that by applying a splicing rule, we not only create new strings, but also allow for the removal of the strings entering the rule. This behaviour seems to correspond better to biochemical reality and is in fact used as a tool in several experimental DNA computations. We show that using this new definition, finite extended H systems can generate all recursively enumerable languages. Even a weaker version of these H systems, defined using the new notion of delay, is shown to be strictly more powerful than H systems defined in the traditional way.