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

DOI10.1109/TC.1987.1676883zbMATH Open0608.94013OpenAlexW1968208913MaRDI QIDQ3748965FDOQ3748965

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cited In (6)

• A new complementation algorithm
• Title not available (Why is that?)
• Study of the complexity of an algorithm to derive the complement of a binary function
• Binary decision tree test functions
• Synthesis of Minimal Binary Decision Trees
• An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs

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)