Comments on the algorithms of Verhelst for the conversion of limited-entry decision tables to flowcharts
- 1 January 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 17 (1) , 43-45
- https://doi.org/10.1145/360767.360807
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.Keywords
This publication has 3 references indexed in Scilit:
- The conversion of limited-entry decision tables to optimal and near-optimal flowchartsCommunications of the ACM, 1972
- The interpretation of limited entry decision table format and relationships among conditionsThe Computer Journal, 1969
- Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing TimeJournal of the ACM, 1966