Karnaugh & Boolean Minimizer vs eXpimal

Karnaugh & Boolean Minimizer is an innovative and versatile application for simplifying Karnaugh Maps and Boolean expressions. It is geared for those involved in engineering fields, more precisely electrical engineering students, academics, digital devices constructors or anybody involved with Boolean expressions. With its powerful minimization capabilities and full-fledged features, this tool gives you the flexibility to work with all forms of Boolean expressions and provides quality solutions. Features: - Minimize Karnaugh Maps up to 8 variables - Step-by-step simplification of Boolean expressions up to 26 (A-Z) variables using Boolean algebra laws and theorems - Step-by-step simplification of Boolean functions up to 8 variables by the Quine–McCluskey algorithm, showing the prime implicant chart and using Petrick's method where appropriate - Multi-Output minimization up to 8 inputs and 8 outputs, using the de-facto industry standard Espresso algorithm - View minimized solutions on Karnaugh Map in Sum-of-Product (SOP/CNF) and Product-of-Sum (POS/DNF) forms - Support Don't Cares - Fill Karnaugh map using truth table, sets of terms and Boolean expressions - View all possible solutions for Karnaugh Maps up to 5 variables - Guaranteed minimal solution when using the Karnaugh Map, Quine–McCluskey and Algebraic Minimizer - Highlight minimized term on Karnaugh map - Optimization of minimized solutions with XOR gates - Generate circuit from minimized solution with AND/OR/NAND/NOR logic gates - Generate random Karnaugh Maps, truth tables and Boolean expressions - Custom keyboard for easy input of Boolean expressions - Support all Boolean operators and constants - Fully customizable Karnaugh Map orientation, variable names, operator symbols and expression format - Import/Export Karnaugh Maps and truth tables as CSV files - Beautiful Dark Mode

The most functional math logic calculator. This application has the functions as follows: - creating truth tables; - finding DNF, CNF, PDNF and PCNF; - finding Zhegalkin polynomial (Undetermined coefficients method and Pascal's triangle method); - making a Karnaugh map; - minimizing Boolean function with equivalence conversion (both briefly and in details); - minimize partially defined functions; - belonging to the Post classes; - plotting logical schemes (both IEC and ANSI schemes); - plotting ladder diagram; - minimizing functions using McCluskey method. Boolean functions may be displayed as multiple characters. Unary operation "negation" may be displayed either as a single character or in the form of an overline. Maximum number of variables in the function is limited by 6. Maximum number of function-embedded negations is limited by 5. Maximum number of characters in the function is limited by 64. Karnaugh maps, PCNF and PDNF functions, Zhegalkin polynomial and the McCluskey method only may be used for operating a value vector. The modulus of vector shall contain 4, 8, 16, 32, or 64 characters. The values of 0 and 1 may be used in this function but it will be subject to simplification only. The implication is inadmissible for plotting a logical scheme. No ads pop up. This application demonstrates intuitively understandable and trouble-free operations. All results are shown in details along with comments.