Affiliation:
1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109 Kassel, Germany. f.otto@uni-kassel.de
Abstract
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.
Subject
Computational Theory and Mathematics,Information Systems,Algebra and Number Theory,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献