skip to main content
article
Free access

On generating binary decision trees with minimum nodes

Published: 01 December 1975 Publication History

Abstract

This paper describes a technique for generating binary decision trees from decision tables. It starts with a fully expended table and does a partial reduction with respect to the actions. The remainder of the reduction is done without reference to actions. Pollack's algorithm is finally applied to determine the next decision to consider.

References

[1]
W. H. Dailey, Some notes on processing limited entry decision tables, Sigplan notices 6, No. 8, 81--89 (Sep. 1971)
[2]
S. L. Pollack, Conversion of limited entry decision tables to computer programs, Comm. ACM 8, No. 11, 677--682 (Nov. 1965)
[3]
V. G. Sprague, On storage space of decision table, Comm. ACM 9, No. 5, 319 (May 1966)
[4]
Toshio Yasui, Some aspects of decision table conversion techniques, Sigplan notices 6, No. 8, 108--111 (Sep. 1971)

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 10, Issue 12
December 1975
25 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/987686
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1975
Published in SIGPLAN Volume 10, Issue 12

Check for updates

Author Tags

  1. binary trees
  2. code optimization
  3. decision tables
  4. topological minimization

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)37
  • Downloads (Last 6 weeks)17
Reflects downloads up to 28 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media