July 2010
Intermediate to advanced
576 pages
13h 3m
English
In this chapter, we study abstract models of machines that can accept input, produce output and have primitive internal memory to keep information about previous inputs. In these machines, the output depends not only on the input but also on the state of the system at the time the input is introduced.
Definition 9.1
A finite state machine (complete sequential machine) is an abstract model of a machine with a primitive internal memory. A finite state machine M consists of
A finite state machine M is ...
Read now
Unlock full access