Restarting Automata

A restarting automaton consists of a finite-state control, a flexible tape with end-of-tape markers that initially contains the input, and a read-write window of a fixed finite size. The objective here is to collect the many results that have been obtained on the various types of restarting automata in one place and to present them in a uniform and systematic way.

In this volume, the expressive capacity of the various systems of restarting automata is studied, the relations computed by certain types of restarting automata with output are investigated, and the restarting automaton is extended to models that process pictures and trees.

Among the book's topics and features:

• Extends the restarting automaton to cooperating distributed and parallel communicating systems of restarting automata
• Presents restarting automata with output, which compute certain binary relations
• Extends the restarting automaton to automata that accept picture languages and tree languages
• Provides a text accessible to advanced undergraduate and graduate students

This title is directly tied to the separate Springer volume, Restarting Automata: The Standard Type of Restarting Automaton and Its Variants. Together, these comprehensive monographs may serve as references for researchers, guides to the literature on restarting automata, and as textbooks for an advanced undergraduate or graduate course in formal language and automata theory.