A state diagram shows states as nodes and transitions as directed arrows. A state table lists the same rules row by row. For a deterministic machine, each valid state/input combination must have one defined next state and the appropriate outputs. The two representations should agree.
Worked example
For a two-state toggle controller, state A with input 0 stays A and input 1 moves to B. State B with input 0 stays B and input 1 moves to A. Draw four labeled arrows, then write four matching table rows.
What to watch for
A missing arrow is an incomplete specification unless a default rule is explicitly given. Multiple applicable arrows need a priority rule or indicate ambiguity.
Try it yourself
How many rows describe two states and one binary input in a complete state table?
Answer: Four: A/0, A/1, B/0 and B/1. Each row requires a defined transition.
How to study this topic
Begin with named states and a complete transition table. Then choose encodings and derive the logic. Trace inputs over several cycles, checking outputs as well as next states, including reset and unexpected encodings.
Explore related programmes
These recorded programmes are upcoming. This article is general educational content, not a syllabus or course sample.
Digital Electronics