Jean-Éric Pin

Edward Hirsch

Nikolay Vereshchagin

Sergei O. Kuznetsov

This book constitutes the proceedings of the 9th International Computer Science Symposium in Russia, CSR 2014, held in Moscow, Russia, in June 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.

9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings

Computer Science - Theory and Applications

Gracinda M S Gomes

Pedro V Silva

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. Contents:Finite Semigroups: An Introduction to a Unified Theory of Pseudovarieties (J Almeida)On Existence Varieties of Regular Semigroups (K Auinger)Varieties of Languages (M J J Branco)A Short Introduction to Automatic Group Theory (C Choffrut)Some Results on Semigroup-Graded Rings (W D Munn)Profinite Groups and Applications to Finite Semigroups (L Ribes)Dynamics of Finite Semigroups (J Almeida)Finite Semigroups Imposing Tractable Constraints (A Bulatov et al.)On the Efficiency and Deficiency of Rees Matrix Semigroups (C M Campbell et al.)Some Pseudovariety Joins Involving Groups and Locally Trivial Semigroups (J C Costa)Partial Action of Groups on Relational Structures: A Connection Between Model Theory and Profinite Topology (T Coulbois)Some Relatives of Automatic and Hyperbolic Groups (M Hoffmann et al.)A Sampler of a Topological Approach to Inverse Semigroups (B Steinberg)Finite Semigroups and the Logical Description of Regular Languages (H Straubing)Diamonds are Forever: The Variety DA (P Tesson & D Thérien)Decidability Problems in Finite Semigroups (P G Trotter)and other papers Readership: Researchers, academics and graduate students in pure mathematics and computer science. Keywords:

Semigroups, Algorithms, Automata and Languages

Dominique Perrin

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 computer science. Infinite Words is the first manual devoted to this topic. Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. The book also looks at the early pioneering work of Büchi, McNaughton and Schützenberger. Serves as both an introduction to the field and as a reference book. Contains numerous exercises desgined to aid students and readers. Self-contained chapters provide helpful guidance for lectures.

Automata, Semigroups, Logic and Games

Infinite Words

Jean-Éric Pin

Books

Your next favorite book is out there