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 based on splicing: universality results
Theoretical Computer Science - Special issue on universal machines and computations
Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
DNA Computing: Distributed Splicing Systems
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
On length-separating test tube systems
Natural Computing: an international journal
Length-separating test tube systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Universality of Splicing Test Tube Systems with Two Tubes
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 5.23 |
Enhanced time-varying distributed H systems (ETVDH systems) are a variant of time-varying distributed H systems (TVDH systems), which is a well-known theoretical model of DNA computing based on splicing. We show that ETVDH systems with 2 components, i.e., having two sets of rules which act periodically, may generate all recursively enumerable languages by simulating type-0 grammars. We also present a new approach to control the computations that can be used in other models of DNA computing based on splicing.