Communications of the ACM

Home/Magazine Archive/January 1974 (Vol. 17, No. 1)/Comments on the algorithms of Verhelst for the conversion.../Abstract

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

By P. J. H. King, R. G. Johnson
Communications of the ACM, January 1974, Vol. 17 No. 1, Pages 43-45
10.1145/360767.360807
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.