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.

Remarks on Relativisations and DNA Encodings 135<br />

Moreover, I-compliance is equivalent to enjoying the first property required<br />

by solidity, which we called solidity/1. Therefore, if a language L is solid, or L<br />

is solid relative to a language in which all strings in L are factors, then L is also<br />

I-compliant.<br />

Finally, it is obvious that if L is solid/1 then it is solid/1 relative to any<br />

language.<br />

The following simple lemma considers another fact about solidity/1 properties,<br />

and will also be used later. It applies, for instance, to the case <strong>of</strong> M = L,<br />

or M = L 2 ,orM = L ∗ .<br />

Lemma 1. A language L is solid/1 iff L is solid/1 relative to a language M in<br />

which all strings in L are factors.<br />

Pro<strong>of</strong>. Solidity/1 is obviously stronger than any relative solidity/1; on the other<br />

hand, relative solidity/1 <strong>of</strong> M verifies that no word <strong>of</strong> L is proper substring <strong>of</strong><br />

any other.<br />

Proposition 1. A language L is solid relative to L ∗ iff L is solid relative to L 2 .<br />

Pro<strong>of</strong>. It is immediate to verify that solidity relative to L ∗ implies solidity relative<br />

to L 2 ,sinceL 2 is a subset <strong>of</strong> L ∗ . We prove the other direction by contradiction:<br />

if L is not solid relative to L ∗ then either L falsifies condition 1, and<br />

the same would be relatively to L 2 ,orawordinL 2 falsifies relative solidity, and<br />

this itself would be the contradiction, or a word w = ypuqz ∈ L n+1 ,withpq non<br />

null and n>1, would contradict solidity. This last case would falsify solidity<br />

relative to L n in one <strong>of</strong> the ways that we will see, and so lead to contradiction<br />

for L 2 .Ifw has a parsing in L n+1 according to which either yp has a prefix or qz<br />

has a suffix in L, then we could build from w, by dropping such prefix or suffix,<br />

a word which would falsify solidity in L n . If no such parsing exists, then pu or<br />

uq falsify condition 1 <strong>of</strong> relative solidity, by spanning on at least one word <strong>of</strong> L<br />

in the string w.<br />

Proposition 2. A language L is I-free iff L is solid relative to L ∗ .<br />

Pro<strong>of</strong>. Proposition 1 allows us to reduce the statement to consider only equivalence<br />

with solidity relative to L 2 . We know that I-freedom implies I-compliance,<br />

which in turns implies solidity/1 and, by Lemma 1, solidity/1 relative to M = L 2 .<br />

By absurd, if L is I-free but would not enjoy second property required by the<br />

relative solidity, then we would have a string w ∈ L 2 such that w = ypuqz with<br />

u non null and pu, uq ∈ L. This would contradict solidity/1 relative to L 2 ,in<br />

case yz, orp or q, would be null, or I-freedom in other cases; for instance, if y<br />

and q are non null, word pu ∈ L would falsify I-freedom.<br />

In the other direction, the solidity relative to L 2 implies the I-freedom, otherwise<br />

we would have a word st = yuz ∈ L 2 such that u ∈ L and both y and z<br />

are non null; u would contradict property 1 <strong>of</strong> relative solidity, if it is a substring<br />

<strong>of</strong> s or t, or property 2 otherwise.

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

Saved successfully!

Ooh no, something went wrong!