An architecture for investigating the dynamical behaviour of biological systems is proposed by using the concepts of behaviour and observer. The behaviour of a biological system is the sequence of states traversed as time passes; the observer is a device translating this behaviour into a readable output. As an instance of this architecture we investigate P/O systems constituted by a membrane system and a multiset finite automaton observer. We first characterize the infinite behaviours of conservative systems, i.e., systems whose number of objects is constant. These systems behave very regularly. For more sophisticated systems we then use also more complicated multiset automata as observers: they map the configurations into an output alphabet and thus we obtain words describing the entire computations. Even for seemingly simple membrane systems using only non-cooperative rules and regular-like observers through this combination a great power emerges, in our case computational universality.
[1]
守屋 悦朗,et al.
J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979
,
1980
.
[2]
Victor Mitrana,et al.
Multiset Automata
,
2000,
WMP.
[3]
Carlos Martín-Vide,et al.
From Watson-Crick L systems to Darwinian P systems
,
2004,
Natural Computing.
[4]
Gheorghe Paun,et al.
Membrane Computing
,
2002,
Natural Computing Series.
[5]
Jeffrey D. Ullman,et al.
Introduction to Automata Theory, Languages and Computation
,
1979
.
[6]
Fred Joseph Gruenberger,et al.
Computing: An Introduction
,
1969
.