Simulating Accepting Networks of Evolutionary Processors with Filtered Connections by Accepting Evolutionary P Systems - Foundations on Natural and Artificial Computation - page 300

blocked in an inner region. If these rules cannot be applied, then other evolution-
ary rules check the presence of permitting symbols. As soon as one permitting
symbol is present, the string is sent to the outer region. Clearly, some special
symbols are used in order to manage the string movements. It is worth noting the
important role of the membrane structure in each region R ij by an analogy with
electronic circuits: the membranes checking in the weak mode the presence of a
permitting symbol form a sort of parallel circuit, while the membranes checking
in the strong mode the presence of a permitting symbol form a sort of serial
circuit.
When a string is going to enter a region of the form R ij where i is the output
node of the ANEPFC, then a new symbol is inserted; this symbol will dissolve
in turn all the membranes.
5 Conclusions and Future Work
In this paper we have proposed a string accepting P system based on a general-
ization of the evolutionary rules considered for ANEPFCs. We have intuitively
described a construction of an AEPS able to naturally simulate an ANEPFC.
We consider that the simulation process is natural as the membrane structure is
of a great importance in the simulation of the filtering process in ANEPFC. It
is worth mentioning that this is in contrast with very many constructions of P
systems in which the membrane structure plays actually a very minor role, most
of them being reduced to just one membrane.
A technical proof together with other computationally aspects of accepting
evolutionary P systems are to be considered for an extension of this note.
References
1. Castellanos, J., Paun, G., Rodrıguez-Paton, A.: P systems with worm-objects. In:
Proc. of the Seventh International Symposium on String Processing Information
Retrieval (SPIRE 2000), pp. 64-74. IEEE Computer Society, Los Alamitos (2000)
2. Dragoi, C., Manea, F., Mitrana, V.: Accepting networks of evolutionary processors
with filtered connections. Journal of Universal Computer Science 13, 1598-1614
(2007)
3. Errico, L., Jesshope, C.: Towards a new architecture for symbolic processing. In:
Artificial Intelligence and Information-Control Systems of Robots 1994, pp. 31-40
(1994)
4. Fahlman, S.E., Hinton, G.E., Seijnowski, T.J.: Massively parallel architectures for
AI: NETL, THISTLE and Boltzmann machines. In: Proc. of the National Confer-
ence on Artificial Intelligence, pp. 109-113 (1983)
5. Hillis, W.D.: The Connection Machine. MIT Press, Cambridge (1979)
6. Krishna, S.R., Lakshmanan, K., Rama, R.: Hybrid P systems. Romanian Journal
of Information Science and Technology 4(1-2), 111-123 (2001)
7. Krishna, S.R., Rama, R.: Insertion-deletion P systems. In: Jonoska, N., Seeman,
N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 360-370. Springer, Heidelberg (2002)
8. Madhu, M., Krithivasan, K.: A note on hybrid P systems. Grammars 5(3), 239-244
(2002)