Comments on the algorithms of Verhelst for the conversion of limited-entry decision tables to flowcharts

Authors:
P. J. H. King;R. G. Johnson
Affiliations:
Birkbeck College, London, U.K.;Birkbeck College, London, U.K.
Venue:
Communications of the ACM
Year:
1974

Citing 2
Cited 2

Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time

Journal of the ACM (JACM)
The conversion of limited-entry decision tables to optimal and near-optimal flowcharts: two new algorithms

Communications of the ACM

Optimal conversion of extended-entry decision tables with general cost criteria

Communications of the ACM
Extending the infomation theory approach to converting limited-entry decision tables to computer programs

Communications of the ACM

Quantified Score

Hi-index	48.25

Visualization

Abstract

In his interesting contribution to the study of the conversion of limited-entry decision tables to flowcharts or sequential testing procedures, Verhelst [1] presents two algorithms, one of which is claimed to produce the optimal flowchart with respect to run-time. Unfortunately this minimum run-time algorithm does not always produce the result claimed, as we illustrate by example below.