P Automata or Purely Communicating Accepting P Systems
In this paper we introduce the notion of a P automaton with one-way communication, a concept related both to Psystems and the traditional concept of automata. A P automaton with one-way communication is a purely communicating accepting Psystem. The result of the computation in these systems is the set of multiset sequences consumed by the skin membrane, supposing that the P automaton started functioning in an initial state and entered a so-called final state. As a result, we show that for any recursively enumerable language, a P automaton and a certain type of projection can be constructed such that the given language is obtained as the image of the set of accepted input multiset sequences of the Pautomaton.
Unable to display preview. Download preview PDF.
- 2.Hopcroft, J. E., Ullman, J. D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.Google Scholar
- 4.Păun, Gh.: Computing with membranes. TUCS Report 208, Turku Centre for Computer Science, 1998.Google Scholar
- 7.Păun, Gh.: Computing with membranes (PSystems): Twenty six research topics. CDMTCS Technical Report 119, Univ. of Auckland, 2000.Google Scholar
- 8.Păun, Gh.: Membrane Computing. An Introduction. Springer-Verlag, Berlin, 2002.Google Scholar