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 …

We consider words indexed by linear orderings. These extend finite,(bi-) infinite words and
words on ordinals. We introduce finite automata and rational expressions for these words …

In a preceding paper (Bruyère and Carton, automata on linear orderings, MFCS'01),
automata have been introduced for words indexed by linear orderings. These automata are …

We develop an algebraic model for recognizing languages of words indexed by countable
linear orderings. This notion of recognizability is effectively equivalent to definability in …

Courcelle introduced the study of regular words, ie, words isomorphic to frontiers of regular
trees. Heilbrunner showed that a nonempty word is regular iff it can be generated from the …

The theorem of factorization forests of Imre Simon shows the existence of nested
factorizations–à la Ramsey–for finite words. This theorem has important applications in …

The theorem of factorisation forests shows the existence of nested factorisations—a la
Ramsey—for finite words. This theorem has important applications in semigroup theory, and …

This paper is a survey on the algebraic approach to the theory of automata accepting infinite
words. We discuss the various acceptance modes (Büchi automata, Muller automata …

Recognizable languages of finite words are part of every computer science cursus, and they
are routinely described as a cornerstone for applications and for theory. We would like to …

We develop an algebraic notion of recognizability for languages of words indexed by
countable linear orderings. We prove that this notion is effectively equivalent to definability in …