Small universal Turing machines
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
Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
DNA computing based on splicing: universality results
Theoretical Computer Science - Special issue on universal machines and computations
Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages
Where mathematics, computer science, linguistics and biology meet
DNA Computing: Distributed Splicing Systems
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
About Time-Varying Distributed H Systems
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
A Universal Time-Varying Distributed H System of Degree 1
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
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
Computation: finite and infinite machines
Computation: finite and infinite machines
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)
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Hi-index | 0.00 |
Time-varying distributed H systems are a well known model of molecular computing. In this article we present an overview of this model, its history, related results, and open problems.