State Reduction and State Assignment
Last Updated :
23 Jul, 2025
To illustrate the process of state reduction and state assignment first we have to know the concepts of the state diagram, state table, and state equation. In this article, we are going to learn all the topics related to state reduction and assignment.
What is State Diagram?
The state graph or state diagram is a pictorial representation of the relationships between the present state, the input state, the next state, and the output state of a sequential circuit i.e. A state diagram is a graphical representation of a sequential circuit's behavior.
Example: Consider an excitation table of J-K flip-flop
The state diagram of the above table is
State Diagram of J-K flip-flop What is State Table?
Even though the behavior of a sequential circuit can be conveniently described using a state diagram, for its implementation the information contained in the state diagram is to be translated into a state table. The tabular form of the state diagram is the state table. The present state, the next state, and the output are the three sections of the diagram.
The State Table of JK flip-flop is
| Inputs | Present state | Output |
|---|
| J | K | Q | Q+ (Output) |
|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 0 |
State equation: Qn+1 = Qn bar J + Qn K bar
What is State Reduction?
The state reduction technique generally prevents the addition of duplicate states. The reduction in redundant states reduces the number of flip-flops and logic gates, reducing the cost of the final circuit. Two states are said to be equivalent if every possible set of inputs generates exactly the same output and the same next state. When two states are equal, one of them can be eliminated without changing the input-output relationship. The state reduction algorithm is applied in the state table to reduce equivalent states.
Advantages of State Reduction
- Reduced Complexity: Lesser number of states result in a reduced complexity of circuits with lesser flip-flops and logic gates.
- Cost Efficiency: Overall cost of the circuit is diminished because of the decision taken for the simplified design.
- Improved Performance: Increased throughput among other features such as low power consumption.
Disadvantages of State Reduction
- Design Time: State reduction may take more time to analyze and compute the data as compared to analyzing the parameter trajectory directly.
- Potential Information Loss: It thus requires precaution so that none of the important information is overlooked during the reduction process.
What is State Assignment?
State assignment refers to the process of assigning binary values to the states of a sequential machine. The binary values should be given to the states in such a way that flip-flop input functions may be implemented with a minimum number of logic gates.
Types of State Assignment Techniques
- Binary Assignment: Gives binary numbers to states on one-to-one basis. This is clear and properly executable yet it may sometimes lead to the creation of an utmost low logical condition.
- Gray Code Assignment: It utilizes Gray codes to bring about minimum change of transition between the states hence reducing the chances of getting glitches in the logic.
- One-Hot Assignment: Conveys each value that specifies a state by means of a specific position of the bits, in which only the one is set to 1. This makes the combinational logic simpler but at a cost of more numbers of flip-flops.
State Assignment rules are as follows
Rule 1: States having the same next state for a given input condition should have assignments that can be grouped into logically adjacent cells in a K-map.
Rule 2: States that are the next states of a single state should have assignments that can be grouped into logically adjacent cells in a K-map.
Example 1: To explain the concept of state reduction let us consider the state table as
| Present state | Next state | Output |
|---|
| X=0 | X=1 | X=0 | X=1 |
|---|
| a | a | b | 0 | 0 |
| b | c | d | 0 | 0 |
| c | a | d | 0 | 0 |
| d | e | f | 0 | 1 |
| e | a | f | 0 | 1 |
| f | g | f | 0 | 1 |
| g | a | f | 0 | 1 |
The state diagram for the above state table is
State diagram before reductionStep1: First here we are supposed to identify two or more similar states in the next state and output state. In the above table if we observe states of e and g are having the same next state and output values for all combinations of input i.e. X=0 and X=1.
So eliminate the g state in the state table and wherever g is present replace it with e. Because e and g both are the same i.e. e=g.
| Present state | Next state | Output |
|---|
| X=0 | X=1 | X=0 | X=1 |
|---|
| a | a | b | 0 | 0 |
| b | c | d | 0 | 0 |
| c | a | d | 0 | 0 |
| d | e | f | 0 | 1 |
| e | a | f | 0 | 1 |
| f | e(g=e) | f | 0 | 1 |
Step 2: Again check if any two states have similar values or not. If any two states have the same next state and output then eliminate one state.
Here d and f are having the same next state value and output. So eliminate f and wherever f is present replace it with d. Because both are the same d=f
| Present state | Next state | Output |
|---|
| X=0 | X=1 | X=0 | X=1 |
|---|
| a | a | b | 0 | 0 |
| b | c | d | 0 | 0 |
| c | a | d | 0 | 0 |
| d | e | d(d=f) | 0 | 1 |
| e | a | d(d=f) | 0 | 1 |
Step 3: Further observe if any similar states are present or not. The states c and e are having same next states but they are having different outputs. So we can not consider it a reduction state.
State diagram After reductionStep 4: If you observed the state table, the states are represented by using the alphabet. We can not proceed further if we are having alphabets, so, assigning binary numbers to alphabets is called a state assignment.
To assign binary numbers to the state we have to consider the minimum number of bits.
The codes must contain n bits for a circuit with m states, where 2n >= m. In this case, each state requires 23 >=5=>3 bits to be represented. With three bits, there are eight possible combinations, of which five can be used to represent the states.
| State | Assignment 1 |
|---|
| Binary |
|---|
| a | 000 |
| b | 001 |
| c | 010 |
| d | 011 |
| e | 100 |
Step 5: Replacing the alphabets with binary numbers.
| Present state | Next state | Output |
|---|
| X=0 | X=1 | X=0 | X=1 |
|---|
| 000 | 000 | 001 | 0 | 0 |
| 001 | 010 | 011 | 0 | 0 |
| 010 | 000 | 011 | 0 | 0 |
| 011 | 100 | 011 | 0 | 1 |
| 100 | 000 | 011 | 0 | 1 |
Advantages of State Assignment
- Minimized Logic Gates: Pre allocation of states on the hardware component can also have an impact of minimizing the number of logic gates in use.
- Simplified Implementation: Some of the state assignment techniques such as Gray coding and one-hot encoding are beneficial in simplifying the circuit design and also improving on the errors that might be present.
Disadvantages of State Assignment
- Increased Flip-Flops: Some of these techniques such as one-hot encoding may need more flip-flops as compared to other techniques.
- Complexity in Assignment: Deciding on which state should be assigned to an AP can be a challenging task and requires sometimes even a huge amount of time.
Conclusion
State reduction and state assignment are very useful in the design of the sequential circuits. State reduction enable fewer numbers of states hence easier in the design of the circuit than state assignment which optimizes the binary form of the states in order to reduce complexity of the circuit. By doing so, these techniques will enable designers to come up with better and more efficient cost-effective digital systems.
Similar Reads
Digital Electronics and Logic Design Tutorials Digital Electronics and Logic Design are key concepts in both electronics and computer science. Digital systems are at the core of everything from basic devices like calculators to advanced computing systems. Digital systems use binary numbers (0s and 1s) to represent and process information.Logic g
4 min read
Number Systems
Boolean Algebra and Logic Gates
Logic Gates - Definition, Types, UsesLogic Gates are the fundamental building blocks in digital electronics. There are basically seven main types of logic gates that are used to perform various logical operations in digital systems. By combining different logic gates, complex operations are performed, and circuits like flip-flops, coun
10 min read
Basic Conversion of Logic GatesIn the Digital System, logic gates are the basic building blocks. Â In these logic gates, we can find the gates having more than one input, but will have only one output. The connection between the input and the output of a gate is based on some logic. Based on this logic, different gates are develop
6 min read
Realization of Logic Gate Using Universal gatesIn Boolean Algebra, the NAND and NOR gates are called universal gates because any digital circuit can be implemented by using any one of these two i.e. any logic gate can be created using NAND or NOR gates only.Implementation of AND Gate using Universal GatesImplementation using NAND GatesThe AND ga
6 min read
Canonical and Standard FormCanonical Form - In Boolean algebra, the Boolean function can be expressed as Canonical Disjunctive Normal Form known as minterm and some are expressed as Canonical Conjunctive Normal Form known as maxterm. In Minterm, we look for the functions where the output results in "1" while in Maxterm we loo
6 min read
Types of Integrated CircuitsIn this article, we will go through the Types of Integrated Circuits, we will start our article with the introductions of the ICs, then we will go through different types of ICs one by one, At last, we will conclude our article will their applications, advantages, disadvantages and some FAQs. Table
7 min read
Minimization Techniques
Minimization of Boolean FunctionsBoolean functions are used to represent logical expressions in terms of sum of minterms or product of maxterms. Number of these literals (minterms or maxterms) increases as the complexity of the digital circuit increases. This can lead to large and inefficient circuits. By minimizing Boolean functio
4 min read
Introduction of K-Map (Karnaugh Map)In many digital circuits and practical problems, we need to find expressions with minimum variables. We can minimize Boolean expressions of 3, 4 variables very easily using K-map without using any Boolean algebra theorems. It is a tool which is used in digital logic to simplify boolean expression. I
5 min read
5 variable K-Map in Digital LogicPrerequisite - Implicant in K-Map Karnaugh Map or K-Map is an alternative way to write a truth table and is used for the simplification of Boolean Expressions. So far we are familiar with 3 variable K-Map & 4 variable K-Map. Now, let us discuss the 5-variable K-Map in detail. Any Boolean Express
5 min read
Various Implicants in K-MapAn implicant can be defined as a product/minterm term in Sum of Products (SOP) or sum/maxterm term in Product of Sums (POS) of a Boolean function. For example, consider a Boolean function, F = AB + ABC + BC. Implicants are AB, ABC, and BC. There are various implicant in K-Map listed below :Prime Imp
5 min read
Don't Care (X) Conditions in K-MapsOne of the most important concepts in simplifying output expressions using Karnaugh Maps (K-Maps) is the 'Don't Care' condition. The 'Don't Care' conditions allow us to treat certain cells in a K-Map as either 0, 1, or to ignore them altogether, which can help in forming larger and more efficient gr
4 min read
Quine McCluskey MethodThe Quine McCluskey method also called the tabulation method is a very useful and convenient method for simplification of the Boolean functions for a large number of variables (greater than 4). This method is useful over K-map when the number of variables is larger for which K-map formation is diffi
8 min read
Two Level Implementation of Logic GatesThe term "two-level logic" refers to a logic design that uses no more than two logic gates between input and output. This does not mean that the entire design will only have two logic gates, but it does mean that the single path from input to output will only have two logic gates.In two-level logic,
9 min read
Combinational Circuits
Half Adder in Digital LogicA half adder is a combinational logic circuit that performs binary addition of two single-bit inputs, A and B, producing two outputs: SUM and CARRY. The SUM output which is the least significant bit (LSB) is obtained using an XOR gate while the CARRY output which is the most significant bit (MSB) is
3 min read
Full Adder in Digital LogicFull Adder is a combinational circuit that adds three inputs and produces two outputs. The first two inputs are A and B and the third input is an input carry as C-IN. The output carry is designated as C-OUT and the normal output is designated as S which is SUM. The C-OUT is also known as the majorit
5 min read
Half Subtractor in Digital LogicA half subtractor is a digital logic circuit that performs the binary subtraction of two single-bit binary numbers. It has two inputs, A and B, and two outputs, Difference and Borrow. The Difference output represents the result of subtracting B from A, while the Borrow output indicates whether a bor
4 min read
Full Subtractor in Digital LogicA Full Subtractor is a combinational circuit used to perform binary subtraction. It has three inputs:A (Minuend)B (Subtrahend)B-IN (Borrow-in from the previous stage)It produces two outputs:Difference (D): The result of the subtraction.Borrow-out (B-OUT): Indicates if a borrow is needed for the next
3 min read
Parallel Adder and Parallel SubtractorAn adder adds two binary numbers one bit at a time using carry from each step. A subtractor subtracts one binary number from another using borrow when needed. A parallel adder adds all bits at once, making addition faster. Similarly, a parallel subtractor subtracts all bits at the same time for quic
5 min read
Sequential Binary MultiplierIn this article, we are going to learn how a sequential binary multiplier works with examples. So for that, we also need to learn a few concepts related to the sequential circuit, binary multipliers, etc. Finally solving the examples using a sequential binary multiplier method.Sequential CircuitA se
12 min read
Multiplexers in Digital LogicIn this article we will go through the multiplexer, we will first define what is a multiplexer then we will go through its types which are 2x1 and 4x1, then we will go through the Implementation of the 2x1 mux and higher mux with lower order mux, at last we will conclude our article with some applic
10 min read
Event Demultiplexer in Node.jsNode.js is designed to handle multiple tasks efficiently using asynchronous, non-blocking I/O operations. But how does it manage multiple operations without slowing down or blocking execution? The answer lies in the Event Demultiplexer.The Event Demultiplexer is a key component of Node.js's event-dr
3 min read
Binary Decoder in Digital LogicA binary decoder is a digital circuit used to convert binary-coded inputs into a unique set of outputs. It does the opposite of what an encoder does. A decoder takes a binary value (such as 0010) and activates exactly one output line corresponding to that value while all other output lines remain in
5 min read
Encoder in Digital LogicAn encoder is a digital circuit that converts a set of binary inputs into a unique binary code. The binary code represents the position of the input and is used to identify the specific input that is active. Encoders are commonly used in digital systems to convert a parallel set of inputs into a ser
7 min read
Code Converters - Binary to/from Gray CodeIn this article, we will go through Code Converters - Binary to/from Gray Code, we will start our article by defining Code converters, Binary code and Gray code, and then we will go through the conversion of binary code to gray code and vice versa.Table Of ContentCode ConvertersBinary CodeGray CodeC
5 min read
Magnitude Comparator in Digital LogicA magnitude digital Comparator is a combinational circuit that compares two digital or binary numbers in order to find out whether one binary number is equal, less than, or greater than the other binary number. We logically design a circuit for which we will have two inputs one for A and the other f
7 min read
Sequential Circuits
Introduction of Sequential CircuitsSequential circuits are digital circuits that store and use the previous state information to determine their next state. Unlike combinational circuits, which only depend on the current input values to produce outputs, sequential circuits depend on both the current inputs and the previous state stor
7 min read
Difference between Combinational and Sequential CircuitIn digital electronics, circuits are classified into two primary categories: The combinational circuits and the sequential circuits. Where the outputs depend on the current inputs are called combination circuit, combinational circuits are simple and effective for functions like addition, subtraction
4 min read
Latches in Digital LogicLatch is a digital circuit which converts its output according to its inputs instantly. To implement latches, we use different logic gates. In this article, we will see the definition of latches, latch types like SR, gated SR, D, gated D, JK and T with its truth table and diagrams and advantages and
7 min read
Flip-Flop types, their Conversion and ApplicationsIn this article, we will go through the Flip-Flop types, their Conversion and their Applications, First, we will go through the definition of the flip-flop with its types in brief, and then we will go through the conversion of the flip-flop with its applications, At last, we will conclude our articl
7 min read
Conversion of Flip-Flop
Register, Counter, and Memory Unit
Counters in Digital LogicA Counter is a device which stores (and sometimes displays) the number of times a particular event or process has occurred, often in relationship to a clock signal. Counters are used in digital electronics for counting purpose, they can count specific event happening in the circuit. For example, in
4 min read
Ripple Counter in Digital LogicCounters play a crucial role in digital logic circuits, enabling tasks such as clock frequency division and sequencing. This article explores the concept of ripple counters, a type of asynchronous counter, their operation, advantages, and disadvantages in digital logic design. What is a Counter?Coun
5 min read
Ring Counter in Digital LogicA ring counter is a typical application of the Shift register. The ring counter is almost the same as the shift counter. The only change is that the output of the last flip-flop is connected to the input of the first flip-flop in the case of the ring counter but in the case of the shift register it
7 min read
General Purpose RegistersA register is a collection of flip-flops. Single bit digital data is stored using flip-flops. By combining many flip-flops, the storage capacity can be extended to accommodate a huge number of bits. We must utilize an n-bit register with n flip flops if we wish to store an n-bit word.General Purpose
8 min read
Shift Registers in Digital LogicPre-Requisite: Flip-FlopsFlip flops can be used to store a single bit of binary data (1 or 0). However, in order to store multiple bits of data, we need multiple flip-flops. N flip flops are to be connected in order to store n bits of data. A Register is a device that is used to store such informati
8 min read
Computer MemoryMemory is the electronic storage space where a computer keeps the instructions and data it needs to access quickly. It's the place where information is stored for immediate use. Memory is an important component of a computer, as without it, the system wouldn’t operate correctly. The computer’s opera
9 min read
Random Access Memory (RAM)Random Access Memory (RAM) is a type of computer memory that stores data temporarily. When you turn off your computer, the data in RAM disappears, unlike the data on your hard drive, which stays saved. RAM helps your computer run programs and process information faster. This is similar to how the br
11 min read
Read Only Memory (ROM)Memory plays a crucial role in how devices operate, and one of the most important types is Read-Only Memory (ROM). Unlike RAM (Random Access Memory), which loses its data when the power is turned off, ROM is designed to store essential information permanently.Here, we’ll explore what ROM is, how it
8 min read
LMNs and GATE PYQs
Practice Questions - Digital Logic & Design