Moore's law (finite state machines)
GPTKB entity
Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
Moore's minimization theorem
|
| gptkbp:appliesTo |
deterministic finite automata
|
| gptkbp:describes |
state minimization
|
| gptkbp:field |
automata theory
|
| gptkbp:formedBy |
gptkb:Edward_F._Moore
|
| https://www.w3.org/2000/01/rdf-schema#label |
Moore's law (finite state machines)
|
| gptkbp:publishedIn |
Sequential Machines: Selected Papers
|
| gptkbp:state |
The minimum number of states in a finite state machine is equal to the number of equivalence classes of the indistinguishability relation on input strings.
|
| gptkbp:year |
1956
|
| gptkbp:bfsParent |
gptkb:E._F._Moore
|
| gptkbp:bfsLayer |
7
|