Synthesis of Minimal Binary Decision Trees

DOI10.1109/TC.1979.1675391MaRDI QIDQ4198637zbMATH OpenFDO

Authors Daniel Mange, Eduardo J. Sanchez, Eduard Cerny

Publication date 1979

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

zbMATH Keywords

minimizationBoolean functionsdecision algorithmsbinary decision treesstandard sets of implicants

Mathematics Subject Classification ID

Recommendations

• Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• Minimization of binary decision diagrams for systems of incompletely defined Boolean functions
• Binary decision tree test functions
• scientific article; zbMATH DE number 3936917
• scientific article; zbMATH DE number 3894979

Cited in

(5)

• A Tree Representation of Combinational Networks
• Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• P-functions: A new tool for the analysis and synthesis of binary programs
• Binary decision tree test functions
• scientific article; zbMATH DE number 3936917 (Why is no real title available?)

This page was built for publication: Synthesis of Minimal Binary Decision Trees

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