Language of Boolean functions its Grammar and Machine
Birendra Kumar Nayak (1), Sudhakar Sahoo (2)
TL;DR
This paper presents an algorithm for generating in-equivalent Boolean functions of any number of variables from basic single-variable functions, along with a grammar and a Turing Machine for recognition.
Contribution
It introduces a novel algorithm, grammar, and Turing Machine model for Boolean functions, expanding understanding of their structure and generation.
Findings
Algorithm successfully generates in-equivalent Boolean functions
Grammar formalizes the structure of Boolean functions
Turing Machine accepts the set of generated Boolean functions
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cellular Automata and Applications · semigroups and automata theory