The principle of raising the degree of indeterminacy of Boolean functions, and an algorithm for determining shortest disjunctive normal forms

Cybernetics ◽  
1971 ◽  
Vol 3 (4) ◽  
pp. 7-13
Author(s):  
Yu. N. Kornev
Keyword(s):  
Boolean Functions ◽  
Normal Forms

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
Keyword(s):  
Boolean Functions ◽  
Normal Forms

scholarly journals On the generation of prime implicants

1979 ◽  
Vol 2 (1) ◽  
pp. 167-186
Author(s):  
Bernd Reusch ◽  
Lothar Detering
Keyword(s):  
Boolean Functions ◽  
Normal Forms ◽  
General Theorem ◽  
General Representation ◽  
Prime Implicants

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