State Machine Theory and Optimization

Abstract

In Chap. 17 we learned how to design, use, and implement state machines. In Chap. 18, we employed these machines as controllers for datapaths. While doing this, we saw their utility in tracking the steps of an algorithm. As a state represents the most important information about a given system and, due to our timing rules, we understand the changes made as we transition from state to state, it’s natural to use a state in this manner. But, as we may recall from all the way back in Chap. 1, we actually understand an algorithm to be an expression of language. Sure, it’s a computer language which is (provably) less expressive in key ways than human languages, but yes, indeed, it is a language. In this way we can concept the state machine as a language processor.