最小函数依赖集的求法

定义：连接模式R#60;U,F#62;上的两个依托集F和G，假设F+=G+，则称F和G是等价的，记做F≡G。若F≡G，则称G是F的一个覆盖，反之亦然。两个等价的函数依托集在表达能力上是完全相同的。

(Definition: The two support sets F and G on the connection mode R#60;U,F#62;, if F =G , then F and G are said to be equivalent, denoted as F≡G. G is said to be a cover of F if F≡G, and vice versa. Two equivalent functional backing sets are identical in expressiveness.)

[下载]16152608921.rar

2022-8-9 16:15 上传

文件大小: 32 KB
下载次数: 0