 Group multiplier automaton

A group multiplier automaton accepts exactly the padded convolutions of words $u\otimes v$ with $u,v\in L$ and $\overline{u}x=\overline{v}$. The case $x=\epsilon$ recognizes equality in the group, rather than equality of literal words over an alphabet.