Figure - available from: Theory of Computing Systems
This content is subject to copyright. Terms and conditions apply.
Hierarchy of language classes that are accepted by the various types of ordered restarting automata. An arrow indicates a proper inclusion, while an arrow with a question mark indicates an inclusion that is not known to be proper. If two classes that are not connected by a sequence of arrows, then they are incomparable under inclusion
Source publication
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 tha...
Similar publications
Here we show that for monotone RWW- (and RRWW-) automata, window size two is sufficient, both in the nondeterministic as well as in the deterministic case. For the former case, this is done by proving that each context-free language is already accepted by a monotone RWW-automaton of window size two. In the deterministic case, we first prove that ea...
