Apart from the massive parallelism of DNA strands, the phenomenon known as Watson-Crick complementarity is basic both in the experiments and the-.
Watson-Crick walks and roads on DOL graphs. article. Share on. Watson-Crick walks and roads on DOL graphs. Author: Arto Salomaa. Arto Salomaa. View Profile.
This paper investigates complementarity as a language-theoretic operation: "bad" words obtained through a generative process are replaced by their complementary ...
DOL systems augmented with a specific complementarity transition, ``Watson-Crick DOL systems", are investigated in this paper and it is found that these ...
Watson-Crick walks and roads on DOL graphs | Acta Cybernetica
cyber.bibl.u-szeged.hu › article › view
Salomaa, A. (1999). Watson-Crick walks and roads on DOL graphs. Acta Cybernetica, 14(1), 179-192.
DOL systems augmented with a specific complementarity transition, "Watson-Crick DOL systems", are investigated in this paper. Many issues involved are ...
Watson-Crick walks and roads on DOL graphs. Image may be subject to use restrictions. See terms and conditions. QR Code. Finna rating.
Any algorithm for solving the road, growth, sequence or language equivalence problem for standard Watson–Crick DOL systems can be converted into an algorithm ...
Watson-Crick Walks and Roads on DOL Graphs. October 1998. Arto Salomaa · Turku Centre · Computer Science. Apart from the massive parallelism of DNA ...
Complete finite automata network graphs with minimal number of edges ... Watson-Crick walks and roads on DOL graphs · Author Picture Arto Salomaa. Pages ...