Comments on the algorithms of Verhelst for the conversion of limited-entry decision tables to flowcharts
P. J. H. King, R. G. Johnson · Communications of the ACM · 1974
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.