  We show that a straightforward extension of a simple learning model based on
the Hebb rule, the previously introduced Association-Reinforcement-Hebb-Rule,
can cope with "delayed", unspecific reinforcement also in the case of
structured data and lead to perfect generalization.
