Abstract
We propose a characterization of a Chomsky-like hierarchy of multiset grammars in terms of multiset automata. We also present the deterministic variants of all the automata investigated and prove that, unlike the string case, most of them are strictly less powerful than the nondeterministic variants. Some open problems and further directions of research are briefly discussed.
Research supported by the Hungarian Scientific Research Fund “OTKA” Grant No. T 029615 and by the Direcci’on General de Enseñanza Superior e Investigaci’on Cienti fica, SB 97-00110508
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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, Gamma and chemical reaction model: ten years after, Coordination Programming: Mechanisms, Models and Semantics (C. Hankin, ed.), Imperial College Press, 1996.
G. Berry, G. Boudol, The chemical abstract machine, Theoretical Computer Sci., 96 (1992), 217–248.
A.B. Cremers, Normal forms for context-sensitive grammars, Acta Informatica, 3 (1973), 59–73.
S. Crespi-Reghizzi, D. Mandrioli, Commutative grammars, Calcolo, 13, 2, (1976), 173–189.
J. Gonczarowski, M.K. Warmuth, Scattered versus context-sensitive rewriting, Acta Informatica, 27 (1989), 81–95.
S. Greibach, J. Hopcroft, Scattered context grammars, J. Comput. Syst. Sci., 3 (1969), 233–247.
R. Helm, K. Marriott, M. Odersky, Building visual language parsers, Proc. ACM Conf. Human Factors in Computing, 1991.
M. Kudlek, C. Martin-Vide, G. Păun, Toward FMT (Formal Macroset Theory), Pre-Proceedings of the Workshop on Multiset Processing (WMP’2000) (C.S. Calude, M.J. Dinneen, G. Păun, eds.), CDMTCS-140, 2000, 149–158.
M. Latteux, Cones rationnels commutatifs, J. of Computer and System Sciences, 18 (1979), 307–333.
K. Marriott, Constraint multiset grammars, Proc. IEEE Symposium on Visual Languages (A. L. Ambler, T. Kimura, eds.), IEEE Comp. Soc. Press, 1994, 118–125.
G. Păun, G. Rozenberg, A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.
G. Păun, Computing with membranes J. of Computer and System Sciences, 61, 1 (2000), 108–143
G. Păun, Computing with membranes (P systems): Twenty six research topics, CDMTCS ReportNo. 119, Auckland University, 2000.
G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, 3 volumes, Springer-Verlag, Berlin, 1997.
Y. Suzuki, H. Tanaka, Symbolic chemical system based on abstract rewriting system and its behavior pattern, Artificial Life Robotics, 1 (1997), 211–219.
Y. Suzuki, H. Tanaka, Chemical evolution among artificial proto-cells, Proc. of Artificial Life VIII Conf., MIT Press, 2000.
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
Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V. (2001). Multiset Automata. 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_4
Download citation
DOI: https://doi.org/10.1007/3-540-45523-X_4
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