Abstract Stateless ordered restart-delete automata (stl-ORD-automata) are studied. These obtained from the stateless restarting (stl-ORWW-automata) by introducing an additional operation, which, based on surrounding context, deletes a single letter. While stl-ORWW-automata accept regular languages, we show that swift stl-ORD-automata yield characterization for class of context-free languages. H...