Comments on the Algorithms of Verhelst for the Conversion of Limited-Entry Decision Tables to Flowcharts

@article{King1974CommentsOT,
  title={Comments on the Algorithms of Verhelst for the Conversion of Limited-Entry Decision Tables to Flowcharts},
  author={Peter J. H. King and Roger G. Johnson},
  journal={Commun. ACM},
  year={1974},
  volume={17},
  pages={43-45}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

The interpretation of limited entry decision table format and relationships among conditions

  • P.J.H. King
  • Comput. J. 12,
  • 1969
Highly Influential
8 Excerpts

Flowcharts and decision tables

  • J. Inglis, P.J.H. King
  • Comput. J. 11,
  • 1968
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…