Easy state tables for compound statement sequence detectors

摘要

A very simple divide-and-conquer method for a class of word statements which breaks down a statement to obtain several simple state tables is presented. By following rules for combining the tables, a correct final state table can be constructed. The method has additional bonuses in that what if changes can be explored, and logically impossible word statements can be detected. The method is easy to apply and it provides students with a way of solving difficult problems correctly.