A note on minimal matrix representation of closure operations |
| |
Authors: | J. Demetrovics Gy. Gyepesi |
| |
Affiliation: | (1) Computer and Automation Institute of the Hungarian Academy of Sciences, Victor Hugo u. 18-22, H-1132 Budapest, Hungary |
| |
Abstract: | A matrixM withn columns represents a closure operationF(A), (A⊂X, |X|=n) if for anyA, any two rows equal in the columns corresponding toA are also equal inF(A). Letm(F) be the minimum number of rows of the matrices representingF. Lower and upper estimates on maxm(F) are given where max runs over the set of all closure operations onn elements. |
| |
Keywords: | 01 A 10 |
本文献已被 SpringerLink 等数据库收录! |
|