Name
Abstract | ||
|---|---|---|
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups and automata lead to simplifications of the graphs on which the corresponding finite semigroups act. We show in particular that every finite semigroup can be finitely expanded so that the expansion acts on a labeled directed graph which resembles the right Cayley graph of a free Burnside semigroup in many respects. |
Year | Venue | Keywords |
|---|---|---|
2011 | Computing Research Repository | automata theory,cayley graph,group theory,formal language,directed graph |
Field | DocType | Volume |
Graph algebra,Discrete mathematics,Bicyclic semigroup,Vertex-transitive graph,Cancellative semigroup,Krohn–Rhodes theory,Algebra,Cayley graph,Special classes of semigroups,Semigroup,Mathematics | Journal | abs/1104.2 |
Citations | PageRank | References |
1 | 0.41 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jon McCammond | 1 | 21 | 4.30 |
| John Rhodes | 2 | 89 | 20.04 |
| Benjamin Steinberg | 3 | 102 | 17.57 |