|
Volumn , Issue , 1995, Pages 229-234
|
Implicit prime compatible generation for minimizing incompletely specified finite state machines
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
BOOLEAN FUNCTIONS;
CALCULATIONS;
COMPUTATIONAL COMPLEXITY;
FINITE AUTOMATA;
SEQUENTIAL MACHINES;
SET THEORY;
THEOREM PROVING;
BINARY DECISION DIAGRAMS;
CLASS SETS;
COMPATIBLES;
FINITE STATE MACHINES;
IMPLICIT PRIME COMPATIBLE GENERATION;
SIGNATURES;
ALGORITHMS;
|
EID: 0029541553
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (4)
|
References (9)
|