08.01.2013 Views

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

The Power <strong>of</strong> Networks <strong>of</strong> Watson-Crick D0L Systems 109<br />

In this case a word w satisfies the trigger for turning to the complementary<br />

word (it is incorrect) if it has more occurrences <strong>of</strong> pyrimidines (barred<br />

letters) than purines (non-barred letters). Formally, consider a DNA-like alphabet<br />

Σ = {a1,...,an, ā1,...,ān} , n ≥ 1. Let ΣPUR = {a1,...,an} and<br />

ΣPYR = {ā1,...,ān}. Then, we define φ : Σ ∗ →{0, 1} as follows: for w ∈ Σ ∗<br />

φ(w) =<br />

� 0 if |w|ΣPUR ≥|w|ΣPYR and<br />

1 if |w|ΣPUR < |w|ΣPYR.<br />

Following [7], we now define the basic notion in this paper, a network <strong>of</strong><br />

Watson-Crick D0L systems (an NWD0L system). It is a finite collection <strong>of</strong> WD0L<br />

systems over the same DNA-like alphabet and with the same trigger, where the<br />

component WD0L systems act in a synchronized manner by rewriting their own<br />

sets <strong>of</strong> strings in the WD0L manner and after each derivation step communicate<br />

some <strong>of</strong> the obtained words to each other. The condition for communication is<br />

determined by the trigger for complementarity transition.<br />

Definition 1 By an NrWD0L system (a network <strong>of</strong> Watson-Crick D0L systems)<br />

with r components or nodes, where r ≥ 1, we mean an r +2-tuple<br />

where<br />

Γ =(Σ,φ,(g1, {A1}),...,(gr, {Ar})),<br />

– Σ = {a1,...,an, ā1,...,ān}, n ≥ 1, is a DNA-like alphabet, the alphabet <strong>of</strong><br />

the system,<br />

– φ : Σ ∗ →{0, 1} is a mapping defining a trigger for complementarity transition,<br />

and<br />

– (gi, {Ai}), 1 ≤ i ≤ r, called the ith component or the ith node <strong>of</strong> Γ, is a pair<br />

where gi is a D0L morphism over Σ and Ai is a correct nonempty word over<br />

Σ according to φ, called the axiom <strong>of</strong> the ith component.<br />

If the number <strong>of</strong> the components in the network is irrelevant, then we speak<br />

<strong>of</strong> an NWD0L system. An NWD0L system is called standard if φ is defined in<br />

the same way as in the case <strong>of</strong> standard WD0L systems.<br />

Definition 2 For an NrWD0L system Γ =(Σ,φ,(g1, {A1}),...,(gr, {Ar})),<br />

r ≥ 1, the r-tuple (L1,...,Lr), where Li, 1 ≤ i ≤ r, is a finite set <strong>of</strong> correct<br />

strings over Σ according to φ, is called a state <strong>of</strong> Γ. Li, 1 ≤ i ≤ r, is called the<br />

state or contents <strong>of</strong> the ith component. ({A1},...,{Ar}) is said to be the initial<br />

state <strong>of</strong> Γ.<br />

NWD0L systems change their states by direct derivation steps. A direct<br />

change <strong>of</strong> a state to another one means a rewriting step followed by communication<br />

according to the given protocol <strong>of</strong> the system. In the following we define<br />

two variants <strong>of</strong> communication protocols, representing different communication<br />

philosophies.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!