Open Access
Time-Varying Distributed H Systems of Degree 1 Generate All Recursively Enumerable Languages.
Maurice Margenstern,Yurii Rogozhin +1 more
- pp 329-339
About:
The article was published on 2001-01-01 and is currently open access. It has received 24 citations till now. The article focuses on the topics: Recursively enumerable language & Maximal set.read more
Citations
More filters
Journal ArticleDOI
Topics in the theory of DNA computing
TL;DR: The theoretical developments of DNA computing are demonstrated by discussing a number of selected topics and an introduction to the basic structure of DNA and the basic DNA processing tools is given.
Book ChapterDOI
Time-Varying Distributed H Systems with Parallel Computations: the Problem is Solved
TL;DR: It is shown that time-varying distributed H systems (TVDH systems) with one component are able to model any type-0 grammar and completely answered the question of constructing TVDH systems of smallest degree which generate any RE language using the parallel nature of molecular computations based on splicing operations.
Book ChapterDOI
Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations
TL;DR: This paper improves the last result by reducing the number of components of such TVDH systems of degree four by modelling type-0 formal grammars.
Journal ArticleDOI
On small, reduced, and fast universal accepting networks of splicing processors
TL;DR: It is shown that accepting networks of splicing processors (ANSPs) of size 2 are computationally complete, and it is proved that ANSPs of size three can decide all languages in NP in polynomial time.
Book ChapterDOI
Communicating Distributed H Systems with Alternating Filters
TL;DR: It suffices to use tuples of two filters in order to generate any recursively enumerable language, with two tubes only, and it is shown that it is possible to obtain the same result having no rules in the second tube which acts as a garbage collector.
References
More filters
Journal ArticleDOI
Small universal Turing machines
TL;DR: Universal Turing machines are proved to exist in the following classes: UTM (24,2), UTM(10,3), U TM(7,4), UTR(5,5), USM(4,6), UTSM (3,10) and U TM (2,18).
Proceedings Article
DNA computing based on splicing: universality results.
TL;DR: In this article, it was shown that a Turing machine computing a partial recursive function can be simulated by an equivalent H system computing the same function; in that way, from a universal Turning machine we obtain a universal H system.
Book ChapterDOI
DNA Computing: Distributed Splicing Systems
TL;DR: First, a result is improved about the so-called communicating distributed H systems (systems with seven components are able to characterize the recursively enumerable languages), then two new types of distributed H system are introduced: the separated two-level H systems and the periodically time-varying H systems, and it is proved that in all these cases one can design universal “DNA computers based on splicing”.