Synthesis of Minimal Binary Decision Trees

DOI10.1109/TC.1979.1675391zbMATH Open0409.94033MaRDI QIDQ4198637FDOQ4198637

Authors: Daniel Mange, Eduardo J. Sanchez, Eduard Cerny 

Publication date: 1979

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

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

zbMATH Keywords

minimizationBoolean functionsdecision algorithmsbinary decision treesstandard sets of implicants

Mathematics Subject Classification ID

Cited In (5)

• A Tree Representation of Combinational Networks
• P-functions: A new tool for the analysis and synthesis of binary programs
• Using Decision Trees to Derive the Complement of a Binary Function with Multiple-Valued Inputs
• Binary decision tree test functions
• Title not available (Why is that?)

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)