Global computing refers to computation over "global computers," i.e., com- tational infrastructures available globally and able to provide uniform services with variable guarantees for communication, cooperation and mobility, resource usage, security policies and mechanisms, etc., with particular regard to explo- ing their universal scale and the programmability of their services. As the scope and computational power of such global infrastructures continue to grow, it - comes more and more important to develop methods, theories and techniques for trustworthy systems running on global...

This book constitutes the refereed proceedings of the 14th International Conference on Foundations of Software Science and computational Structures, FOSSACS 2011, held in Saarbrucken, Germany, March 26--April 3, 2011, as part of ETAPS 2011, the European Joint Conferences on Theory and Practice of Software. The 30 revised full papers presented together with one full-paper length invited talk were carefully reviewed and selected from 100 submissions. The papers are organized in topical sections on coalgebra and computability, type theory, process calculi, automata theory, semantics, binding,...

Das Buch beschaftigt sich mit der Theorie endlicher Automaten und den klassischen Resultaten wie den Satzen von Richard Buchi und Michael Rabin. Die vier Teile des Buchs sind den unterschiedlichen Strukturen gewidmet: endliche Worter, Baume, endliche und unendliche Baume. Jeder Teil endet mit Ubungsaufgaben zum behandelten Stoff sowie Hinweisen auf weiterfuhrende Literatur. Soweit Vorkenntnisse zur Theorie formaler Sprachen vorhanden sind, kann das Buch ohne weitere Hilfsmittel durchgearbeitet werden.