Participants performed an artificial grammar learning task, in which the standard finite
state grammar (J. Verb. Learn. Verb. Behavior 6 (1967) 855) was extended with a recursive
rule generating self-embedded sequences. We studied the learnability of such a rule in two experiments.
The results verify the general hypothesis that recursivity can be learned in an artificial
grammar learning task. However this learning seems to be rather based on recognising
chunks than on abstract rule induction. First, performance was better for strings with more
than one level of self-embedding in the sequence, uncovering more clearly the self-embedding
pattern. Second, the infinite repeatability of the recursive rule application was not spontaneously
induced from the training, but it was when an additional cue about this possibility was
given. Finally, participants were able to verbalise their knowledge of the fragments making up
the sequences––especially in the crucial front and back positions––, whereas knowledge of the
underlying structure, to the extent it was acquired, was not articulatable. The results are discussed
in relation to previous studies on the implicit learnability of complex and abstract rules.