Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Restricting the Use of Auxiliary Symbols for Restarting Automata
verfasst von : Tomasz Jurdziński, Friedrich Otto
Erschienen in: Implementation and Application of Automata
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The most general models of restarting automata make use of auxiliary symbols in their rewrite operations. Here we put restrictions on the way in which restarting automata use auxiliary symbols, and we investigate the influence of these restrictions on their expressive power. In fact, we consider two types of restrictions. First, we consider the
number of auxiliary symbols
in the tape alphabet of a restarting automaton as a measure of its descriptional complexity. Secondly, we consider the
number of occurrences of auxiliary symbols
on the tape as a dynamic complexity measure. We establish some lower and upper bounds with respect to these complexity measures concerning the ability of restarting automata to recognize the (deterministic) context-free languages and some of their subclasses.