Christian S. Calude (ed.); Jose Felix Gomes da Costa (ed.); Rudolf Freund (ed.); Marion Oswald (ed.); Grzegorz (e Rozenberg Springer (2008) Pehmeäkantinen kirja
Christian S. Calude (ed.); Jose Felix Gomes da Costa (ed.); Nachum Dershowitz (ed.); Elisabete Freire (ed.); Grze Rozenberg Springer (2009) Pehmeäkantinen kirja
Christian S. Calude (ed.); Masami Hagiya (ed.); Kenichi Morita (ed.); Grzegorz Rozenberg (ed.); Jonathan Timmis (ed.) Springer (2010) Pehmeäkantinen kirja
Themultiset (a set with multiplicities associated with its elements, in the form of natural numbers) is a notion which has appeared again and again in many areas of mathematics and computer science, sometimes called abag (some h- torical information appears in the enclosed paper by A. Syropoulos). As a data structure, this notion stands "in-between"strings/lists, where a linear ordering of symbols/items is present, andsets, where no ordering and no multiplicity is considered;inamultiset,onlythemultiplicityofelementsmatters,nottheir ordering. Actually, in between lists and multisets we also havepomsets, partially ordered multisets. Con?ning ourselves to computer science, we may mention many areas where multisets are used: formal power series, Petri nets, data bases, logics, formal language theory (in relation with Parikh mapping, commutative grammars, etc), concurrency, and so on. In the last few years, the notion has occurred in a rather natural way in the molecular computing area. An aqueous solution of chemical compounds, swimming together in a given space, without any given spatial relation between individual elements, is just a multiset. Actually, this chemical metaphor was used several years before the occurrence of what is now called molecular computing, as the basic ingredient of the Gamma language and the Chemical Abstract Machine (a comprehensive survey of these ideas is provided by J. -P. Ban atre, P. Fradet, D. Le Metayer).
