Abstract
A multiset involves an equivalence relation between the copies of the same element. However, in many cases the binary relation relating an element to its copies is not exactly an equivalence one, but a weaker relation, in most cases a tolerance (i.e., reflexive and symmetric) relation, leading to a natural extension of multisets: tolerance multisets.
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
E. ÄŒech, Topological Spaces, The Publishing House of the Czech Academy, Prague,1966.
A. Dovier, A. Policrity, G. Rossi, A uniform axiomatic view of lists, multisets, andsets, and the relevant unification algorithms, Fundamenta Informaticae, 36, 2/3(1998), 221–234.
E. Ehrlich, S. Berg Flexner, G. Garruth, J.M. Hawkins, Oxford American Dictionary,Avon Books, Oxford Univ. Press, New York, 1980.
E. Genouvrier, C. Desirat, T. Horde, Nouveau Dictionnaire des Synonymes, Librairie Larousse, Paris, 1980.
Z.S. Harris, Structural Linguistics, Chicago Univ. Press, Chicago, 1961.
S. Kanger, The notion of a phoneme, Statistical Methods in Linguistics, 3 (1964),43–48.
D. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms,Addison Wesley, Reading, Mass., 1985.
M. Kudlek, C. Martin-Vide, Gh. Păun, Toward FMT (Formal Macroset Theory),in Pre-proceedings of the Workshop on Multiset Processing, Curtea de Argesc Romania,2000(C.S. Calude, M.J. Dinneen, Gh. Păun, eds.), CDMTCS Res. Report 140, Auckland Univ., 2000, 149–158.
Z. Manna, R. Waldinger, The Logical Basis for Computer Programming, vol. 1,2, Addison Wesley, Reading,Mass., 1985.
S. Marcus, Sur un ouvrage de Stig Kanger concernant le phoneme, Statistical Methodsin Linguistics, 3 (1964), 43–48.
S. Marcus, Introduction Math’ematique à la Linguistique Structurale, Dunod, Paris,1967.
S. Marcus, Mathematische Poetik, Athen↑m, Frankfurt am Main, 1973.
S. Marcus, Interplay of innate and acquired in some mathematical models of languagelearning processes, Revue Roumaine de Linguistique, 34 (1989), 101–116.
S. Marcus, Tolerance rough sets, Čech topologies, learning processes, Bull. PolishAcademy of Science. Technical Science, 42, 3 (1994), 471–487.
Z. Pawlak, Theoretical Aspects of Reasoning About Data, Kluwer, Dordrecht, 1991.
Gh. Paun, Computing with membranes, Journal of Computer and System Sciences,61, 1 (2000), 108–143, and Turku Center for Computer Science-TUCS Report No208, 1998 (http://www.tucs..).
J. Pogonowski, Tolerance Spaces with Applications in Linguistics, Poznan UniversityPress, Poznan, 1981.
A. Syropoulos, Mathematics of multisets, in Pre-proceedings of the Workshop onMultiset Processing, Curtea de Argesc Romania, 2000 (C.S. Calude, M.J. Dinneen, Gh. Păun, eds.), CDMTCS Res. Report 140, Auckland Univ., 2000, 286–295.
A. Tzouvaras, The linear logic of multisets, Logic Journal of GPL, 6, 6 (1998),901–916.
R.R. Yager, On the theory of bags, Intern. Journal of General Systems, 13 (1986),23–37.
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
Marcus, S. (2001). Tolerance Multisets. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-45523-X_10
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