Search Results for "mccluskey"
Sort By:
Showing 16 open source projects for "mccluskey"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
1
JQM Java Quine McCluskey
JQM - Java Quine McCluskey for minimization of Boolean functions.
Java Quine McCluskey (JQM) implements the Quine-McCluskey algorithm with Petrick’s Method for minimizing Boolean functions. Designed for both education and industrial application, it handles up to 16 variables and functions. Uniquely, JQM bridges the gap between theory and practice: it visualizes the solution process with generated Karnaugh Maps for students, while supporting PLC engineers by exporting results to Structured Text (ST) and Ladder Diagram (LD). -
2
Advance-PCT-1.0
A novel Code transformation technique to guide test input generator
...It is done to achieve higher MC/DC, because according to the definition of MC/DC it is required to achieve 100% condition coverage, which was not possible due to short-circuit evaluation by the compiler, due to which MC/DC was low and inadequate. This code transformation technique resolves the problem. It has applied Quince-McCluskey simplification technique to resolve complexness of predicate and then applying the method of inserting empty nested if-else conditional statements. -
3
LOGIKI
Scheme and LisP programs to work with logical expressions
this program written in Scheme (a Lisp dialect) manipulate logical expressions. Logiki can put any logical expression in disjunctive (DNF) or conjunctive (CNF) normal form and can simplify the expressions,detecting antilogies and tautologies, finding minimal form, you can also display the result in infix notation with or without use of symbols. Author: Damien MATTEI (Nice - France) -
4
Quine-McCluskey minimizer
simplifies boolean functions with Quine-McCluskey algorithm
Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm -
Powerful App Monitoring Without Surprise BillsTired of monitoring tools that punish you for scaling? AppSignal offers transparent, predictable pricing with every feature unlocked on every plan. Track errors, monitor performance, detect anomalies, and manage logs across Ruby, Python, Node.js, and more. Trusted by developers since 2012 with free dev-to-dev support. No credit card required to start your 30-day trial.
-
5
QuineMc Boolean Function Optimizer
Boolean Function Optimizer using Quine–McCluskey algorithm
this project uses Quine–McCluskey algorithm to optimize boolean functions, the input function should be given in terms of minterm numbers and the output is optimized and in form of sum of products(SOP) there is also a Cost calculation and comparison between different optimizations. -
6
Logic function minimization
Program for minimizing boolean functions not using Karnaugh K-maps
Logic function minimizer is a free open software, which is developed to solve the Digital Electronics design problems. Using Quine-McCluskey algorithm -
7
Truth Table Solver is a program that solves the truth table and output all the possible minimized boolean expressions.It uses Quine-McCluskey algorithm (Tabulation method) for boolean minimization.It has an easy to use GUI and a command line mode.
-
8
Quine-McCluskey boolean logic simplifier implemented in C++. It allows simplifying up to 32 variable input functions, including don't-care values. The program was written for digital design classes at the Poznan University of Technology (Poland).
-
9
This project is a collection of tools that are useful for someone working in the computer engineering field. So far this program is able to do logic minimization using the Quine-McClusky Method, numeric base conversion, and some bit manipulations.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
10
Quinessence is conceived as a package to perform optimal two-level realization of a boolean function using the classical Quine-McCluskey algorithm.
-
11
Processes boolean functions which can be provided either as a list of 0s and 1s or which can be provided as a formula in first-order logic (using disjunctive or conjunctive normal forms). Internally the Quine McCluskey algorithm is used.
-
12
...It's designed with the purpose to be used as a tool on university degrees such as computer science, for teaching the process of boolean function simplification, through the Quine-McCluskey algorithm.
-
13
This is a program which helps to simplify boolean equations, using the Quine-McCluskey method. It has several input options, and produces a file with the process followed. Supports a maximum 29 input variables, depending on present memory on the computer.
-
14
The Quine McCluskey Simplifier(qmcs) is a tool used to simplify a boolean function. With the input of binary/decimal data the program calculates the prime implicants, which are then used to calculate the essential prime implicants.
-
15
produce full software package using the binary decision diagram (BDD) representation to manipulate logic maps for design optimization objectives multiplyer{like(A+B)(C)(D)}In C++ Core.C++ GUI.VB6 Verilog Modules Quin McCluskey Multi Functions Operations
-
16
The Quine-McCluskey Logic Simplifier is a utility written to simplify digital logic. You feed it a canonical decimal list and it does the rest.
- Previous
- You're on page 1
- Next
