Language of Boolean functions its Grammar and Machine
arXiv:0802.4131
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.
5 pages, two tables, presented in Orissa Mathematical Society Conference, January, 2008