Language of Boolean functions its Grammar and Machine
Logic in Computer Science
2008-02-29 v1
Abstract
In this paper an algorithm is designed which generates in-equivalent Boolean functions of any number of variables from the four Boolean functions of single variable. The grammar for such set of Boolean function is provided. The Turing Machine that accepts such set is constructed.
Keywords
Cite
@article{arxiv.0802.4131,
title = {Language of Boolean functions its Grammar and Machine},
author = {Birendra Kumar Nayak and Sudhakar Sahoo},
journal= {arXiv preprint arXiv:0802.4131},
year = {2008}
}
Comments
5 pages, two tables, presented in Orissa Mathematical Society Conference, January, 2008