Restriction of 1-Limited Automata that can only perform one write over the entire computation (on the first visit of one cell).
They are as powerful as 1-LA, accepting Regular Languages, in both the nondeterministic and deterministic variants.
The nondeterministic variant is as succinct as 1-LAs with respect to the classic regular recognizers, while the deterministic variant is way less succinct.