This project proposal is based on an unpublished work (which is discussed in "other technical details" section), wherein we observed that the logic gates and/or circuits obtained from Boolean functions can be combined using the graph operations. One of the motivations of this proposal relies on the fact that converting Boolean functions into simple graphs enables us to use graph operations like union and intersection to construct a system of the complicated logic circuit with minimum simplification steps/axioms. Further, representation of the truth outputs of a Boolean function with simple labeled graph is a wonderful visualization of an abstract entity. Also, converting a Boolean function into a graph or a matrix has a great potential applications in cryptography. Detailed explanation of the mechanism of converting a Boolean function into a graph and vice-versa are explained in the attached unpublished manuscript.
Jawaharlal Nehru College, Pasighat, Arunachal Pradesh
Acces sibility Controls