A complete taxonomy is presented for restarting automata without auxiliary symbols. In this taxonomy, the language classes that are accepted by deterministic and nondeterministic, monotone, weakly monotone, and non-monotone, shrinking and length-reducing restarting automata are compared to each other with respect to inclusion. As it turns out, the 45 types of restarting automata considered yield 29 different classes of languages. By presenting a collection of rather simple example languages, it is shown that, for any two of these language classes ℒ1 and ℒ2, the class ℒ1 is a subclass of ℒ2 if and only if ℒ1 is defined by a type of restarting automaton that is a restriction of a type of restarting automaton that defines the class ℒ2.

中文翻译：

---

无需辅助符号即可重新启动自动机的完整分类法

提供了一个完整的分类法，无需辅助符号即可重新启动自动机。在此分类法中，将确定性和非确定性，单调，弱单调和非单调，收缩和缩短长度的重启自动机所接受的语言类相互比较。事实证明，所考虑的45种重启自动机产生了29种不同的语言。通过展示相当简单的示例语言的集合，可以表明，对于这些语言类ℒ1和ℒ2中的任何两个，只要且仅当ℒ1由重新启动的自动机类型（即a）定义时，ℒ1是ℒ2的子类。限制重新定义类型defines2的自动机的类型。