Open AccessIMPLEMENTASI PENYEDERHANAAN FUNGSI BOOLE DENGAN METODE QUINE McCLUSKEY
Author(s) -
Alfatah Hidayat,
Siti Rahmah Nurshiami,
Mashuri Mashuri
Publication year - 2021
Publication title -
jurnal ilmiah matematika dan pendidikan matematika (jmp)/jurnal ilmiah matematika dan pendidikan matematika
Language(s) - English
Resource type - Journals
eISSN - 2550-0422
pISSN - 2085-1456
DOI - 10.20884/1.jmp.2021.13.2.4873
Subject(s) - product term , implicant , boolean function , boolean data type , computer science , function (biology) , quine , canonical normal form , product (mathematics) , boolean expression , parity function , discrete mathematics , mathematics , algorithm , theoretical computer science , two element boolean algebra , algebra over a field , programming language , pure mathematics , geometry , evolutionary biology , filtered algebra , biology
Quine McCluskey method is one method that can be used to simplify the Boolean function. The Quine McCluskey method has several advantages including having simpler, more systematic steps than other methods and it is easier to simplify the Boolean function with a large number of variables. This study discusses the design of a Boolean function simplification program for the Quine McCluskey method using Visual Basic 6.0. The resulting program can simplify the Boolean function with many variables less than equal to 26 variables and able to simplify the Boolean function in the form of Sum of Product (SOP), Product of Sum (POS), and don't care.