DocumentCode :
673057
Title :
On computation of De Morgan and quasi-De Morgan functions
Author :
Movsisyan, Yuri M. ; Aslanyan, Vahagn A.
Author_Institution :
Yerevan State Univ., Yerevan, Armenia
fYear :
2013
fDate :
23-27 Sept. 2013
Firstpage :
1
Lastpage :
6
Abstract :
In this paper we give various algorithms for computation of De Morgan and quasi-De Morgan functions. We define the disjunctive and conjunctive normal forms for De Morgan and quasi-De Morgan functions and introduce the concept of Zhegalkin polynomial for the case of quasi-De Morgan functions as well as prove some results analogous to the classical Zhegalkin representation theorem on Boolean functions. The obtained results have richer matter that those in the classical case.
Keywords :
Boolean functions; set theory; Zhegalkin polynomial; conjunctive normal forms; disjunctive normal forms; quasiDe Morgan function computation; Boolean functions; Educational institutions; Generators; Lattices; Polynomials; Antichain; Boolean function; De Morgan and quasi-De Morgan function; Zhegalkin polynomial; Zhegalkin-type representation; disjunctive (conjunctive) normal form; monotone Boolean function;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science and Information Technologies (CSIT), 2013
Conference_Location :
Yerevan
Print_ISBN :
978-1-4799-2460-8
Type :
conf
DOI :
10.1109/CSITechnol.2013.6710334
Filename :
6710334
Link To Document :
بازگشت