scholarly journals Composition of Post classes and normal forms of Boolean functions

2006 ◽  
Vol 306 (24) ◽  
pp. 3223-3243 ◽  
Author(s):  
Miguel Couceiro ◽  
Stephan Foldes ◽  
Erkko Lehtonen
2016 ◽  
Vol 12 (1) ◽  
pp. 5-24
Author(s):  
L. Haviarová ◽  
E. Toman

Abstract In the present paper we consider symmetric Boolean functions with special property. We study properties of the maximal intervals of these functions. Later we show characteristics of corresponding interval graphs and simplified interval graphs. Specifically we prove, that these two graphs are isomorphic for symmetric Boolean function. Then we obtain the vertex degree of these graphs. We discuss also disjunctive normal forms.


1979 ◽  
Vol 2 (1) ◽  
pp. 167-186
Author(s):  
Bernd Reusch ◽  
Lothar Detering

It is shown that various well-known normal forms for Boolean functions can be derived from a very general representation of subfunctions. Another general theorem on the relation between the prime implicants of a function and the prime implicants of its subfunctions is used to prove correct various methods of generating prime implicants.


Sign in / Sign up

Export Citation Format

Share Document