Display title | Finite-state machine |
Default sort key | Finite-state machine |
Page length (in bytes) | 42,137 |
Namespace ID | 0 |
Page ID | 217453 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
Page image |  |
HandWiki item ID | None |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Page creator | imported>John Stpola |
Date of page creation | 19:40, 6 February 2024 |
Latest editor | imported>John Stpola |
Date of latest edit | 19:40, 6 February 2024 |
Total number of edits | 1 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to... |