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 are interested in automata over infinite words and infinite duration games,
that we view as general transition systems. We study transformations of systems using a …

Determinism of devices is a key aspect throughout all of computer science, simply because
of considerations of efficiency of the implementation. One possible way (among others) to …

We study transformations of automata and games using Muller conditions into equivalent
ones using parity or Rabin conditions. We present two transformations, one that turns a …

Unambiguous automata, ie, nondeterministic automata with the restriction of having at most
one accepting run over a word, have the potential to be used instead of deterministic …

We survey in this paper some variants of the notion of determinism, refining the spectrum
between non-determinism and determinism. We present unambiguous automata, strongly …

Functional MSO transductions, deterministic two-way transducers, as well as streaming
string transducers are all equivalent models for regular functions. In this paper, we show that …

We give a new proof showing that it is not possible to define in monadic second-order logic
(MSO) a choice function on the infinite binary tree. This result was first obtained by Gurevich …

A nondeterministic automaton is semantically deterministic (SD) if different nondeterministic
choices in the automaton lead to equivalent states. Semantic determinism is interesting as it …

We prove that finite-state transducers with injective behavior, deterministic or not, real-time
or not, with no extra memory or a single counter, cannot compress any normal word. We …