Information Technology Reference
In-Depth Information
Positive traces:
< load, edit, edit, save, close >
< load, edit, save, edit, edit >
< load, close, exit >
< load, edit, save, edit, save >
< load, edit, save, close, exit >
Negative traces:
< load, close, close >
Fig. 1.
Prefix Tree Acceptor with added negative trace
those states that are most likely to produce high scores called the “Blue-Fringe”
strategy. A detailed description is provided by Lang
et al.
, or in a subsequent sur-
vey of grammar inference techniques by Cicchello and Kremer [19].
To provide the reader with an intuition of how the algorithm operates, we
refer to the example in Figure 1. The state machine at the top represents a
simple, fictional text editor. The task is to infer it from the set of traces given
