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.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.