31. Chow's method assumes simple finite state machines with observable inputs and outputs, but no directly observable states. 32. Informally, the algorithm constructs a finite state machine that resembles a trie with additional links between the various internal nodes. 33. Simple software systems, particularly ones that can be represented using regular expressions, can be modeled as Finite State Machines . 34. The use of finite state machines allows " morx " tables to be relatively small and to be processed relatively quickly. 35. A system is specified as a set of interconnected abstract machines which are extensions of finite state machines ( FSM ). 36. A Stream X-Machine ( SXM ) is an extended finite state machine with auxiliary memory, inputs and outputs. 37. All languages generated by a regular grammar can be recognized in O ( n ) time by a finite state machine . 38. Basically, it is a textual representation of a finite state machine , given as a list of possible state transitions. 39. Finite state machine models and communicating finite-state machines are used to formally describe the possible interactions of the protocol.40. A grammar processor that does not support recursive grammars has the expressive power of a finite state machine or regular expression language.
