We examine a class of infinite two-person games on finitely coloured graphs. The main aim
is to construct finite memory winning strategies for both players. This problem is motivated by …

The need for a comprehensive survey-type exposition on formal languages and related
mainstream areas of computer science has been evident for some years. In the early 1970s …

The subject of this chapter is the study of formal languages (mostly languages recognizable
by finite automata) in the framework of mathematical logic. The connection between …

Infinite Words is an important theory in both Mathematics and Computer Sciences. Many
new developments have been made in the field, encouraged by its application to problems …

In this paper we develop a new algorithm for deciding the winner in parity games, and hence
also for the modal μ-calculus model checking. The design and analysis of the algorithm is …

Infinite two-person games are a natural framework for the study of reactive nonterminating
programs. The effective construction of winning strategies in such games is an approach to …

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus,
considered as an algebraic system rather than a logic. We have wished to present the …

Nondeterminism models an ability to see the future: An automaton with an infinite look
ahead can successfully resolve its nondeterministic choices. An automaton is history …

A pushdown game is a two player perfect information infinite game on a transition graph of a
pushdown automaton. A winning condition in such a game is defined in terms of states …

We give a proof that alternating tree automata can be simulated by nondeterministic tree
automata which yields new complexity results and a unified proof of the theorems of Rabin …