scispace - formally typeset
Open AccessBook

Fundamentals of semigroup theory

John Howie
Reads0
Chats0
TLDR
Inverse semigroups as discussed by the authors are a subclass of regular semigroup classes and can be seen as semigroup amalgamations of semigroup groups, which is a special case of regular semiigroups.
Abstract
1. Introductory ideas 2. Green's equivalences regular semigroups 3. 0-simple semigroups 4. Completely regular semigroups 5. Inverse semigroups 6. Other classes of regular semigroups 7. Free semigroups 8. Semigroup amalgams References List of symbols

read more

Citations
More filters
Book

The q-theory of Finite Semigroups

TL;DR: The q-theory of finite semigroups as mentioned in this paper is a theory that provides a unifying approach to finite semigroup theory via quantization, and it is the only contemporary exposition of the complete theory of the complexity of finite semiigroups.
Journal Article

Timed Regular Expressions

TL;DR: This article defines timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and proves that its expressive power is equivalent to the timed automata of Alur and Dill, the timed analogue of Kleene Theorem.
Journal ArticleDOI

Directed Graphs and Combinatorial Properties of Semigroups

TL;DR: In this paper, a complete description of all commutative semigroups satisfying three other combinatorial properties defined in terms of directed graphs is given, by a graph we mean a directed graph without loops or multiple edges.
Journal ArticleDOI

Power graphs: A survey

TL;DR: This article gives a survey of all results on the power graphs of groups and semigroups obtained in the literature.
Journal ArticleDOI

Cayley graphs as classifiers for data mining: The influence of asymmetries

TL;DR: This paper proposes a new method of using Cayley graphs for classification of data using the endomorphism monoids of graphs, a convenient tools expressing asymmetries of the graphs.