Theoremresearch
Krohn–Rhodes theorem
Also called Krohn–Rhodes decomposition theorem.
Every finite automaton's transition monoid decomposes into a cascade of simple groups and aperiodic monoids.
Every finite automaton's transition monoid decomposes into a cascade of simple groups and aperiodic monoids.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag Y6M4HN Edit this page History Report an error