Multiset Processing by Means of Systems of Finite State Transducers
We introduce a computing mechanism of a biochemical inspiration (similar to a P system from the area of Computing with Membranes) which consists of a multiset of symbol-objects and a set of finite state transducers. The transducers process symbols in the current multiset in the usual manner. A computation starts in an initial configuration and ends in a halting configuration. The power of these mechanisms is investigated, as well as the closure properties of the obtained family. The main results say that (1) systems with two components and an unbounded number of states in each component generate all gsm images of all permutation closures of recursively enumerable languages, while (2) systems with two states in each component but an unbounded number of components can generate the permutation closures of all recursively enumerable languages, and (3) the obtained family is a full AFL. Result (2) is related to a possible (speculative) implementation of our systems in biochemical media.
KeywordsClosure Property Terminal Symbol Unbounded Number Membrane Computing Nonterminal Symbol
Unable to display preview. Download preview PDF.
- 4.J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer, Berlin, 1989.Google Scholar
- 5.J. Dassow, Gh. Păun, On the power of membrane computing, J. Univ. Computer Sci., 5, 2 (1999), 33–49.Google Scholar
- 6.A. Kelemenova, J. Kelemen, A grammar-theoretic treatment of multiagent systems, Cybernetics and Systems, 23 (1992), 210–218.Google Scholar
- 7.S. N. Krishna, R. Rama, A variant of P systems with active membranes: Solving NP-complete problems, Romanian J. of Information Science and Technology, 2, 4 (1999).Google Scholar
- 8.Gh. Păun, Computing with membranes, submitted, 1998 (see also TUCS Research Report No. 208, November 1998, http://www.tucs.fi).
- 9.Gh. Păun, Computing with membranes. An introduction, Bulletin of the EATCS, 67 (1999), 139–152.Google Scholar
- 10.Gh. Păun, P systems with active membranes: Attacking NP complete problems, submitted 1999, and Auckland University, CDMTCS Report No 102, 1999 (www.cs.auckland.ac.nz/CDMTCS).Google Scholar
- 11.Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.Google Scholar
- 12.Gh. Păun, G. Rozenberg, A. Salomaa, Membrane computing with external output, submitted, 1998 (see also TUCS Research Report No. 218, December 1998, http://www.tucs.fi).
- 13.Gh. Păun, T. Yokomori, Membrane computing based on splicing, Preliminary Proc. of Fifth Intern. Meeting on DNA Based Computers (E. Winfree, D. Gifford, eds.), MIT, June 1999, 213–227.Google Scholar
- 15.I. Petre, A normal form for P systems, Bulletin of the EATCS, 67 (1999), 165–172.Google Scholar
- 17.Y. Suzuki, H. Tanaka, On a LISP implementation of a class of P systems, submitted, 1999.Google Scholar