Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs

DOI10.1109/TC.1987.1676883MaRDI QIDQ3748965zbMATH OpenOpenAlexFDO

Authors A. H. Chan

Publication date 1987

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1987.1676883

zbMATH Keywords

recursive algorithmmultiple-valued logicBoolean functionsdisjunctive normal formcomplement of logical expressionminimization of logical expressions

Mathematics Subject Classification ID

Recommendations

• An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• scientific article; zbMATH DE number 3894983
• Synthesis of Minimal Binary Decision Trees
• Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
• scientific article; zbMATH DE number 3894979

Cited in

(6)

• An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• Study of the complexity of an algorithm to derive the complement of a binary function
• scientific article; zbMATH DE number 3894983 (Why is no real title available?)
• A new complementation algorithm
• Synthesis of Minimal Binary Decision Trees
• Binary decision tree test functions

This page was built for publication: Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748965)