13th International Conference on Membrane Computing - MTA Sztaki

Fast hardware implementations of P systems
Linear
2-circular
Circular
Opposite
Fig. 3. Objects min/max/mean values for the experiments using 10 rules.
whose dependency graph forms a chain. For example, consider a set rules forming
a circular dependency graph for a system working in the smax mode.
r 1 r 2 . . . r n
❉ 3 ❉ 3 1 ❑❑
11 ❑
a
0 a 1 a 2 a n−1
Now let C be a configuration where all these rules are applicable exactly one
time (corresponding to the case 3 described in Section 4.1). Then the joint applicability
vectors of these rules (i.e. binary strings of length n with value 1 in
i-th position corresponding to the choice of rule r i ) can be described by taking
the words of length n of the following automaton
1
q 2
0
q 1
0
q 3
0
✂✂✂✂✂✂✂
1
q ✂ 1 0 q 0
0
q 1 3
This automaton is obtained from the automaton for the language L I from
Example 1 by adding an additional condition: if rule r 1 is chosen then r n is not
chosen and conversely.
1
1
1
q 4
q 4
449