Abstract
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.
Research supported by Grant OGP0007877 of the Natural Sciences and Engineering Research Council of Canada and, in the case of the first author, also by “Research for Future” Program no. JSPS-RFTF 96I00101, from the Japan Society for the Promotion of Science.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. P. Banâtre, A. Coutant, D. Le Metayer, A parallel machine for multiset transformation and its programming style, Future Generation Computer Systems, 4 (1988), 133–144.
J. P. Banâtre, D. Le Metayer, Programming by multiset transformation, Communications of the ACM, 36 (1993), 98–111.
G. Berry, G. Boudol, The chemical abstract machine, Theoretical Computer Sci., 96 (1992), 217–248.
J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer, Berlin, 1989.
J. Dassow, Gh. Păun, On the power of membrane computing, J. Univ. Computer Sci., 5, 2 (1999), 33–49.
A. Kelemenova, J. Kelemen, A grammar-theoretic treatment of multiagent systems, Cybernetics and Systems, 23 (1992), 210–218.
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).
Gh. Păun, Computing with membranes, submitted, 1998 (see also TUCS Research Report No. 208, November 1998, http://www.tucs.fi).
Gh. Păun, Computing with membranes. An introduction, Bulletin of the EATCS, 67 (1999), 139–152.
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).
Gh. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.
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).
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.
Gh. Păun, S. Yu, On synchronization in P systems, Fundamenta Informaticae, 38, 4 (1999), 397–410
I. Petre, A normal form for P systems, Bulletin of the EATCS, 67 (1999), 165–172.
G. Rozenberg, A. Salomaa, Eds., Handbook of Formal Languages, 3 volumes, Springer-Verlag, Berlin, 1997.
Y. Suzuki, H. Tanaka, On a LISP implementation of a class of P systems, submitted, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Păun, G., Thierrin, G. (2001). Multiset Processing by Means of Systems of Finite State Transducers. In: Boldt, O., Jürgensen, H. (eds) Automata Implementation. WIA 1999. Lecture Notes in Computer Science, vol 2214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45526-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-45526-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42812-1
Online ISBN: 978-3-540-45526-4
eBook Packages: Springer Book Archive