The proof that finite automata can’t implement backreferences is actually extremely simple: you need to remember all the text matches as part of any given captu

The proof that finite automata can’t implement backreferences is actually extremely simple: you need to remember all the text matches as part of any given capture group, in order to match it again as a backreference. This requires unbounded memory.