Classical Finite Transformation Semigroups
Download Classical Finite Transformation Semigroups PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Classical Finite Transformation Semigroups book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Classical Finite Transformation Semigroups
Author: Olexandr Ganyushkin
language: en
Publisher: Springer Science & Business Media
Release Date: 2008-12-10
The aim of this monograph is to give a self-contained introduction to the modern theory of finite transformation semigroups with a strong emphasis on concrete examples and combinatorial applications. It covers the following topics on the examples of the three classical finite transformation semigroups: transformations and semigroups, ideals and Green's relations, subsemigroups, congruences, endomorphisms, nilpotent subsemigroups, presentations, actions on sets, linear representations, cross-sections and variants. The book contains many exercises and historical comments and is directed first of all to both graduate and postgraduate students looking for an introduction to the theory of transformation semigroups, but also to tutors and researchers.
Congruence Lattices of Ideals in Categories and (Partial) Semigroups
Author: James East
language: en
Publisher: American Mathematical Society
Release Date: 2023-04-07
View the abstract.
Formal Properties of Finite Automata and Applications
Author: Jean E. Pin
language: en
Publisher: Springer Science & Business Media
Release Date: 1989-10-11
The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years on the mathematical foundations form the first part of the book. The second part is devoted to the important problems of the theory including star-height, concatenation hierarchies, and connections with logic and word problems. The last part presents a large variety of possible applications: number theory, distributed systems, algorithms on strings, theory of codes, complexity of boolean circuits and others.