| G. Paun Membrane Computing - An Introduction. Springer-Verlag, Berlin, 2002. |
....the inspiration of such biological processes. Splicing systems (see [9] 12] are a generative mechanism based on the splicing operation as a model of DNA recombination. If these systems have finite sets of axioms and rules defining splicing they can generate regular languages (see details in [15]) Keeping both sets finite the generative power can only be increased by introducing control systems. In this way splicing systems can generate recursive enumerable languages. A computability model C is computationally complete if the devices in C have the power of Turing machines (or of any ....
....the nature of the input: if it is the coding of a splicing system we will have a direct construction, if it is the coding of another kind of computability models we will have indirect construction. The description of a small direct universal extended H system was indicated as research topic in [15]. In this paper we describe a direct construction of a universal splicing system and we will see how its size is smaller than the ones of the indirect universal extended H system. 2 An overview of splicing We give definitions strictly related to our work; more general information may be found in ....
[Article contains additional citation context not shown here]
G. Paun, G. Rozenberg, A. Salomaa. DNA Computing, Springer Verlag, 1998
....and self reproduction can be realized in a reversible environment, especially in a reversible cellular space. Recently, various kinds of interesting computing models which directly reflect laws of nature have been proposed and investigated. For example, quantum computing [12, 13] DNA computing [1, 46], reversible computing, are such ones. A reversible computing system is a kind of model reflecting physical reversibility. According to our present scientific knowledge, microscopic physical law is strictly reversible. Hence it is reasonable to study how complex phenomena appear in a reversible ....
Paun, Gh., Rozenberg, G., and Salomaa, A., DNA Computing, Springer-Verlag, Berlin (1998).
....only familiarity with the elementary aspects of the theory of regular languages and nite automata is required. For this material see [Y97] or selected chapters in either [L79] or [BP85] If references for the theory of codes are desired, see [L79] BP85] and [JK97] Regarding DNA behavior, see [PRS98]. In the two closing paragraphs of this Section our choice of automata notation is established and used to con rm a regularity result concerning the set of factors of a language. Let M = A; Q; q 0 ; F; E) be a deterministic automaton where: Q is the set of states of M ; q 0 is the initial state ....
....satisfying. For a fascinating new example of the use of DNA molecules as message carriers, see [CRB99] Acknowledgments. The results in this article arose in part from an e ort to analyze theoretically the potential of biomolecular operations used in various sticker approaches to DNA computing [PRS98]. Partial support for this research through NSF CCR 9509831 and DARPA NSF CCR 9725021 is gratefully acknowledged. ....
Gh.Paun, G.Rozenberg, & A.Salomaa, DNA Computing, Springer Verlag, Berlin, 1998.
No context found.
G. Paun Membrane Computing - An Introduction. Springer-Verlag, Berlin, 2002.
No context found.
Gh. Paun, G. Rozenberg, A. Salomaa, DNA Computing, Springer-Verlag, Berlin, 1998.
No context found.
Paun, Gh., Rozenberg, G., and Salomaa, A., DNA Computing, Springer-Verlag, Berlin (1998).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC