|
|
|
An FSM defines a pattern namely the set of strings labeling paths from the initial state in the graph of the machine. In this section we meet regular expressions, which are an algebraic way to define patterns.
|
|
|
Last modified: 27/July/98 (12:14)