检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《浙江大学学报(理学版)》2015年第6期668-671,共4页Journal of Zhejiang University(Science Edition)
基 金:Supported by research topic funded projects of Shandong Province(J06P14)
摘 要:给出了逻辑方程解集关系定理、将逻辑方程F=G化为0型或1型逻辑方程的方法以及相应的推论,并给予证明,得到:若F+G=1和F G=1的解集分别为S1、S2,则F=G的解集为S1-S2;若F+G=0和F+G=0的解集分别为S3、S4,则F=G的解集为S3∪S4;若F·G=1和F·G=1的解集分别为S5、S6,则F=G的解集为S5∪S6;同时亦得到{F=1F=0:若逻辑方程组、的解集分别为X1、X2,则逻辑方程F=G的解集为X1∪X2,应G=1{G=0用此结论可解非0型、非1型及相关的逻辑方程.This paper proposes a theorem on the relationship between the solution set of the logic equation and a logic equation approach which transforms the logic equation F=Ginto zero type or one type,along with its corresponding counter parts and their proofs.The solution sets of equation F=Gis just S1-S2 if the solution sets for the equations F+G=1and F G=1are S1 and S2,respectively.If the solution sets for the equations F+G=0and F+G=0present S3 and S4,respectively,then the solution set for equation F=Gis S3∪ S4.Assume that the solution sets for equation FG=1and F·G=1are S5 and S6respectively,the solution set of logic equation F=Gis S5 US6.{F=1F=0Similarly,one infers that if the solution sets of logic equations and X2 respectively,the soG=1{are X1 and G=0lution set of logic equation F=G will be X1∪ X2.These above results can be devoted to investigate other related logic equations with non-zero and non-one types.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.58.73.22