A program in Java and QT Jambi to convert an NFA to a DFA and minimize it
-
Updated
Mar 1, 2017 - Java
A program in Java and QT Jambi to convert an NFA to a DFA and minimize it
An approach to algorithm optimization through circuit minimization techniques.
UTR FER2 2014./2015
Determine the minimum cost of a cluster using dynamic programming.
Backtracking. Solve the problem of two headquarters that have their costs and a cost of change.
Two greedy algorithms to the problem of choose a headquarters of two , each headquarters had their costs and a cost of changed of headquarters. One algorithm have a selection function with the cost of change an the other without that cost.
A comprehensive collection of implementations and resources related to the SIMPLEX algorithm.
Implementing Quine-McCluckey algorithm in java with GUI and web application.
A generic bounded model checker.
Add a description, image, and links to the minimization topic page so that developers can more easily learn about it.
To associate your repository with the minimization topic, visit your repo's landing page and select "manage topics."