Title: Granular hierarchical structures of finite naïve subsets and multisets based on free monoids and homomorphisms

Authors: Tetsuya Murai; Sadaaki Miyamoto; Masahiro Inuiguchi; Seiki Akama

Addresses: Graduate School of Information Science and Technologies, Hokkaido University, Sapporo 060-0814, Japan. ' Department of Risk Engineering, University of Tsukuba, Tsukuba 305-8577, Japan. ' Graduate School of Engineering Science, Osaka University, Toyonaka 560-8531, Japan. ' Asao-ku, Kawasaki-shi, 215-0012, Japan

Abstract: In this paper, we present granular hierarchical structures in which finite naïve subsets and multisets are formulated by means of free monoids and homomorphisms. Our motivation is the observation that we actually write a finite subset as a finite sequence, i.e., string, in the well-known extensive notation. Such correspondence from subsets to strings, however, is not one-to-one because the concept of subsets care neither order nor repetition of their elements. The reason is nothing but a straight consequence from the axiom of extensionality. Then we must represent subsets as equivalence classes of strings with respect to some appropriate equivalence relation based on a homomorphism. Then multisets are also similarly considered as we have granular hierarchal structures of 'strings-multisets-naïve subsets'. It should be noted that these formulations only require the numbers how many times each element occurs in every string. Finally the approach is shown to be able to describe every operations of finite subsets and multisets in the level of strings.

Keywords: granularity; strings; free monoids; naïve subsets; multisets; homomorphisms.

DOI: 10.1504/IJRIS.2012.050370

International Journal of Reasoning-based Intelligent Systems, 2012 Vol.4 No.3, pp.118 - 128

Published online: 16 Nov 2012 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article