Name
Abstract | ||
|---|---|---|
#G(S) denotes the complexity of a finite semigroup as introduced by Krohn and Rhodes. IfI is a maximal ideal or maximal left ideal of a semigroupS, then#G(I) ? #G(S) ? #G(I) + 1. Thus, ifV is an ideal ofS with#G(S) = n ? k = #G(V), then there is a chain of ideals ofS
$$V = V_k \subset V_{k + 1} \subset ... \subset V_n \subseteq S$$
with#G(Vj) =j, i.e., complexity is continuous with respect to ideals. |
Year | DOI | Venue |
|---|---|---|
1967 | 10.1007/BF01692497 | Mathematical Systems Theory |
Keywords | Field | DocType |
Computational Mathematic,Maximal Ideal,Left Ideal,Sequential Machine,Finite Semigroup | Discrete mathematics,Combinatorics,Sequential machine,Finite-state machine,Maximal ideal,Semigroup,Mathematics | Journal |
Volume | Issue | Citations |
1 | 1 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenneth Krohn | 1 | 24 | 4.34 |
| Richard Mateosian | 2 | 88 | 31.49 |
| John Rhodes | 3 | 89 | 20.04 |