King, P.J.H. and Johnson, R.G. (1974) Comments on the algorithms of Verhelst for the conversion of limited-entry decision tables to flowcharts. Communications of the ACM 17 (1), pp. 43-45. ISSN 0001-0782.
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.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 27 Apr 2021 21:46 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/44023 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
