搜索资源列表
Q-MLogicOptimization
- 卡诺图在变量数目很多时，不 容易 化简，Quine-McCluskey(Q-M）方法基本原理 与卡诺图相同当变量数目很多时，或者有许多function要做化简时，都需要使用计算机来做，而Q-M方法为一个系统的逻辑代数化简流程.-Karnaugh map of the large number of variables.
bfunc
- Quine–McCluskey algorithm-Quine - McCluskey algorithm
Quine_McCluskey
- by Quine and McCluskey
QMV
- Quine-McCluskey 算法 C语言实现, (链表) 自己学校的编程实验作业, 自己编的-Quine - McCluskey algorithm C language. (List) of their schools experimental programming operations, their series
prog3_1_pc
- Quine-McCluskey Method
QMC-source
- 用Java实现Quine McCluskey逻辑简化算法
quine-mcKluskey
- Quine McKluskey 算法是用来解决数字电路中的逻辑函数问题,这在电路中的布局中尤为重要.
quine-mcKluskey
- Quine McKluskey Algorithm: The Quine McKluskey algorithm is used for minimization of logical (boolean) functions. This an important aspect in all electrical circuits allowing cheaper components and assuring that the simplest solution (circuit) for
Quine-McCluskey
- this qmc algorithm..hope can help you-this is qmc algorithm..hope can help you
Quine-McCluskey
- Quine-McCluskey算法的C代码实现-Quine-McCluskey Algorithm in C code implementation
qmcinMATLABin6.0
- please approve for me..so that i can download for the Quine-McCluskey in C language.thank you.
quine
- Quine-mcCluskey program with GUI. it prints the boolean simplification of a logical expression through a tabulation method
logic
- 我们熟悉的逻辑函数化简方法是卡诺图法。卡诺图法具有简单、直观的优点，但当变量数目达到或超过5个以后，卡诺图将变得很复杂，甚至无法使用。而列表法对于解决多变量逻辑函数化简具有显著的优越性，并且这种方法有严格规则和步骤，便于计算机操作。列表法最早由Quine和Mcluskey提出，因此该法又称为Q-M法。许多数字电路课本上给出了便于手工计算的列表法，但并没有给出实际利用计算机语言实现的方法。-We are familiar with the logic function is the K-map S
Quine
- Basic quine program. User should understand the logic of quine beforehand.
Quine
- Quine is a program that prints itself
Quine-McCluskey
- Quine–McCluskey算法，C++语言编写-Quine–McCluskey Algorithm,finished with C++
qmc
- Quine Mc Cluskey Algorithm in C Sharp
Quine-McCluskey_algorithm_(Java)
- Quine McCluskey in Java
Quine-McCluskey_algorithm_(Java)
- Quine-McCluskey algorithm(Java)
QM
- quine mccluskey code for logical circut