Universal Computation with Watson-Crick D0L Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F02%3A50000002" target="_blank" >RIV/47813059:19240/02:50000002 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Universal Computation with Watson-Crick D0L Systems
Original language description
Watson-Crick D0L systems, introduced in 1997 by Mihalache and Salomaa, arise from two major principles: the Lindenmayer rewriting and the Watson-Crick complementarity principle. Complementarity can be viewed as a purely language-theroetic operation. Majority of a certain type of symbols in a string (purines vs. pyrimidines) triggers a transition to the complementary string. The paper deals with an expressive power of deterministic interactionless Watson-Crick Lindenmayer systems. A rather suprising result is obtained: these systems, consisting of iterated morphism and basic DNA operation, are able to compute any Turing computable function.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GP201%2F02%2FP079" target="_blank" >GP201/02/P079: Distributed models of cognitive computing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
289
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
16
Pages from-to
485-501
UT code for WoS article
—
EID of the result in the Scopus database
—