A new minimal rough set axiom group
โ Scribed by Dai Jian-hua
- Publisher
- Wuhan University
- Year
- 2004
- Tongue
- English
- Weight
- 325 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1007-1202
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper two algorithms are presented which compute a set of generators of minimal cardinality for a finite soluble group given by a polycyclic presentation. The first can be used when a chief series is available. The second algorithm is less simple, but nevertheless efficient, and can be used
In this paper, a set of new separation axioms in L-fuzzy topological spaces are defined and studied. We give several characterizations of these separation axioms and discuss certain relationships among them. Moreover, some of their basic properties are also examined.