Single use register automata for data words

We introduce a new automaton model for data words, called single use register automata.
These are like register automata for data words (introduced by Kaminski and Francez), with the restriction that every read access to a register destroys the register contents.
We prove that the following models are equivalent:
    one-way deterministic single use register automata;
    two-way deterministic single use register automata;
    languages recognised by orbit-finite semigroups.