|↑| ❪✺₁❫ System Classes ○ | State Table ○꠹ ⦍[[| ]]⦎
⮞ 🟣 𓂃𓂃𓂃
⮞ ➔ State Diagram ○꠹
⮞ ➔ Truth Table ○꠹
⮞ ⛛ 𓂃𓂃𓂃
Entries
State Table ○꠹｜Definition｜1st｜20251119205401-00-⌔
State-transition table - Wikipedia
State-transition table
In automata theory and sequential logic, a state-transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite-state machine will move to, based on the current state and other inputs. It is essentially a truth table in which the inputs include the current state along with other inputs, and the outputs include the next state along with other outputs.
A state-transition table is one of many ways to specify a finite-state machine. Other ways include a state diagram.
Printed 2026-06-28.
(echo:: @ ᯤ)
Link to original
Fields
admin::|[[|⚐]],[[|⚐]],[[|⚐]],[[|⚐]],[[|⚐]],
withheld::|————
relation::|————
parent_::|State ○,
parent::|↑| ❪✺₁❫ System Classes ○ | State Table ○꠹ ⦍[[| ]]⦎