Pumping of a group multiplier automaton
= Pumping of a group multiplier automaton
In an accepted <padded convolution of words>, a loop after one tape ends can be deleted or repeated while keeping that entire tape fixed. The altered other tape still represents the same required neighbouring <group> element. A shortest representative has a suffix no longer than the fixed number of automaton states; an accepted longer suffix gives infinitely many representatives of the same element.