11. Hierarchical state machines are finite state machines whose states themselves can be other machines. 12. A computer is a finite state machine that may be viewed as a discrete system. 13. For the purposes of processing the finite state machine , glyphs are organized into classes. 14. How will the machine create constants larger than the capacity of its finite state machine ? 15. Frances Grodzinsky et al . considered artificial systems that could be modelled as finite state machines . 16. A finite state machine is implemented within the coherence controller to determine state changes for blocks. 17. The example in figure 4 shows a finite state machine that accepts the string " nice ". 18. ATNs build on the idea of using finite state machines ( Markov model ) to parse sentences. 19. Alternately, it is a finite state machine which has no output, and only an input. 20. This approach allows representing of visualizer's logic as a system of interacting finite state machines .
