Abstract
We introduce K-subset transforming systems as a generalization of multiset transformation. A K-subset, which is a generalization of a multiset where “multiplicities” take values in a semiring, is considered by S. Eilenberg. We construct an example of K-subset transforming system which models a chaotic discrete dynamical system. We show that for every basic reaction of multiset transformation we can construct a K-subset transforming system which expresses the multiset transformation. We also show that for every phrase structure grammar there is a K-subset transforming system such that the system simulates derivations of the grammar.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Banâtre, A. Coutant, and D. Le Metayer, A parallel machine for multiset transformation and its programming style, Future Generations Computer Systems, 4 (1988), 133–144.
J. Banâtre and D. Le Métayer, Programming by multiset transformation, Communications of the ACM, 36 (1993), 98–111.
J. Dassow and G. Păun, On the power of membrane computing, Journal of Universal Computer Science, 5 (1999), 33–49.
W. D. Blizard, The development of multiset theory, Modern Logic, 1 (1991), 319–3522.
S. Eilenberg, Automata, Languages, and Machines Volume A, Academic Press, New York, 1974.
C. Hankin, D. Le Métayer, and D. Sands, Refining multiset transformers, Theoretical Computer Science, 192 (1998), 233–258.
G. T. Herman and G. Rozenberg, Developmental Systems and Languages, North-Holland, Amsterdam, 1975.
M. Martelli, Discrete Dynamical Systems and Chaos, Longman Scientific & Technical, Harlow, 1992.
G. Păun, Computing with membranes, Journal of Computer and System Sciences, 61 (2000), 108–143, (and Turku Centre for Computer Science-TUCS Report No 208, 1998 (http://www.tucs..)).
G. Păun, Computing with membranes. An introduction, Bulletin of the EATCS 67 (1999) 139–152.
G. Păun, P systems: an early survey, The Third International Colloquium on Words, Languages and Combinatorics March 2000, Kyoto (Proceedings will be published by World Scientific, Singapore).
G. Păun, G. Rozenberg, and A. Salomaa, DNA Computing, Springer-Verlag, Berlin, 1998.
A. Salomaa, Formal Languages, Academic Press, New York, 1973.
P. W. Shor, Algorithm for quantum computation: discrete log and factoring, in: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994.
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
Yasunobu Nishida, T. (2001). Multiset and K-Subset Transforming Systems. In: Calude, C.S., PĂun, G., Rozenberg, G., Salomaa, A. (eds) Multiset Processing. WMC 2000. Lecture Notes in Computer Science, vol 2235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45523-X_13
Download citation
DOI: https://doi.org/10.1007/3-540-45523-X_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43063-6
Online ISBN: 978-3-540-45523-3
eBook Packages: Springer Book Archive