“…Each of the allowed transitions is associated with the addition of a symbol, so in going from the entry state to any of the exit states on the diagram, different sequences of symbols can be constructed. For example, M-S-V would be a grammatical sequence, but V-V-X would not be because once a V has been added to a sequence, there is no transition that could lead to the second V. In this example, the symbols associated with each allowed transition in the finite state grammar are letters, but there is no restriction as to what they could be replicated in later research (Brooks & Vokey, 1991;Dulany et al, 1984;Gomez & Schvaneveldt, 1994;Higham, 1997;Higham, Vokey, & Pritchard, 2000;Knowlton & Squire, 1994;Mathews et al, 1989;Meulemans & van der Linden, 1997;Mathews et al, 1989;Perruchet & Pacteau, 1990;Pothos & Bailey, 2000;Shanks, Johnstone, & Staggs, 1997;Whittlesea & Dorken, 1993; for discussions of AGL results see Dienes, 1992;Reber, 1989;Redington & Chater, 1996).…”