This festschrift volume in honour of Donald B McAlister on the occasion of his 65th birthday presents papers from leading researchers in semigroups and formal languages. The contributors cover a number of areas of current interest: from pseudovarieties and regular languages to ordered groupoids and one-relator groups, and from semigroup algebras to presentations of monoids and transformation semigroups. The papers are accessible to graduate students as well as researchers seeking new directions for future work.

This festschrift volume in honour of Donald B McAlister on the occasion of his 65th birthday presents papers from leading researchers in semigroups and formal languages. The contributors cover a number of areas of current interest: from pseudovarieties and regular languages to ordered groupoids and one-relator groups, and from semigroup algebras to presentations of monoids and transformation semigroups. The papers are accessible to graduate students as well as researchers seeking new directions for future work.

This festschrift volume in honour of Donald B McAlister on the occasion of his 65th birthday presents papers from leading researchers in semigroups and formal languages. The contributors cover a number of areas of current interest: from pseudovarieties and regular languages to ordered groupoids and one-relator groups, and from semigroup algebras to presentations of monoids and transformation semigroups. The papers are accessible to graduate students as well as researchers seeking new directions for future work.

This is a rigorous and self-contained monograph on a central topic in theoretical computer science. For the first time in book form, original results from the last ten years are presented, some previously unpublished, using combinatorial and algebraic methods. These are mainly based on combinatorics on words and especially on the theory of "unavoidable regularities." Researchers will find important new results on semigroups and formal languages, as well as various applications for these methods.

The proceedings present some new topics and techniques of semigroup theory. Papers by leading experts in this theory are collected. Since results on semigroups have naturally been employed in formal languages and codes, the focus is also on these directions.

This uniquely authoritative and comprehensive handbook is the first work to cover the vast field of formal languages, as well as their applications to the divergent areas of linguistics, dvelopmental biology, computer graphics, cryptology, molecular genetics, and programming languages. The work has been divided into three volumes.

The thematic term on “Semigroups, Algorithms, Automata and Languages” organized at the International Centre of Mathematics (Coimbra, Portugal) in May-July 2001 was the gathering point for researchers working in the field of semigroups, algorithms, automata and languages. These areas were selected considering their huge recent developments, their potential applications, and the motivation from other fields of mathematics and computer science.This proceedings volume is a unique collection of advanced courses and original contributions on semigroups and their connections with logic, automata, languages, group theory, discrete dynamics, topology and complexity. A selection of open problems discussed during the thematic term is also included.

Semigroups, Formal Languages and Groups contains articles that provide introductory accounts of recent research in rational languages and their connections with finite semigroups, including the celebrated BG=PG theorem, infinite languages, free profinite monoids and their applications to pseudovarieties, parallel complexity classes related to automata, semigroups and logic, algebraic monoids, geometric methods in semigroup presentations, automatic groups and groups acting on Lambda-trees. There is also an extensive survey of algorithmic problems in groups, semigroups and inverse monoids. In addition, the book includes hitherto unpublished research on monoids of Lie type and their representations, free actions of groups on Lambda-trees and an extension to arbitrary semigroups of the famous Krohn-Rhodes theorem.

The conference was a rare occasion for different schools and perspectives to meet in a single event, bringing together researchers interested in semigroups, automata and languages. The proceedings contain both surveys and research reports, which have been carefully refereed. They should be of value to both mathematicians and computer scientists.