Deterministic version of Once-Marking Limited Automata. Regular Languages acceptors.
While the nondeterministic variant is as succinct as 1-LAs with respect to the classic regular recognizers, the deterministic version can be simulated by 2DFA with polynomial (cubic) cost in size (they are therefore less succinct than D1-LA).