-
2227 total visitsQuine-McCluskey Method can be used to minimize boolean functions with Quine-McCluskey algorithm.Quine-McCluskey Method takes as parameters the minterms, don't-care terms and the number of variables. The script determines the essencial primes and returns them in an array.Requirements: PHP 5.0 or higher -
1807 total visitsBit Options implements the ArrayAccess interface so you can access boolean values as an array of bits. The entire array of bits can be evaluated and returned as a string with 1s and 0s.Requirements: PHP 5.0 or higher
-
1971 total visitsBoolean Minimization can be used to minimize boolean expressions using base 3 matrix. It takes as parameters minterms and variables. It performs boolean minimization and returns the prime implicants as a class array variable.Boolean Minimization uses the principle that any combination of causal conditions is a line number in the base 3 matrix. Also a prime implicant produced by minimizing ...
-
1628 total visitsSimplifica is a script that implements the Quine-McCluskey's tabular method for simplifying boolean expressions. It computes the canonical form of an expression.Simplifica is useful for teaching students how to simplify expressions using an iterative method, instead of Karnaugh, and how boolean algebra may be applied for solving the problem.
-
1596 total visitsPermissions uses integer bit masks to represent user access permissions. Each bit of an integer permission value represents one condition that determines whether the user can read, write, delete, etc. an associated resource. Permissions allows easy and acurate storage of complex sets permissions in a single integer value. The class can convert back and forth between permission bit mask values ...
