Arguably the earliest and most fundamental result on identity testing questions are word problems on finitely generated groups and semigroups [1]}. There is a large body of work on the Compressed Word problem [2]} which studies the computational complexity of word problems when the word is represented succinctly via a straight line program; see [3]}, [4]} for relations between such word problems and arithmetic identity testing.
