Stateless ordered restart-delete automata (stl-ORD-automata) are studied. These are obtained from the stateless ordered restarting automata (stl-ORWW-automata) by introducing an additional restart-delete operation, which, based on the surrounding context, deletes a single letter. While the stl-ORWW-automata accept the regular languages, we show that the swift stl-ORD-automata yield a characterization for the class of context-free languages. Here a stl-ORD-automaton is called swift if it can move its window to any position after performing a restart. We also study the descriptional complexity of swift stl-ORD-automata and relate them to limited context restarting automata.

研究了无状态有序重启删除自动机（stl-ORD-automata）。这些是从无状态有序重新启动自动机（stl-ORWW-automata）中获得的，方法是引入附加的重新启动-删除操作，该操作会根据周围的上下文删除单个字母。尽管stl-ORWW-automata接受常规语言，但我们显示，快速的stl-ORD-automata产生了无上下文语言类的特征。如果stl-ORD-自动机在执行重新启动后可以将其窗口移动到任何位置，则称其为swift。我们还研究了快速stl-ORD-自动机的描述复杂性，并将它们与有限的上下文重新启动自动机联系起来。