how to minimize an automata and what Is need of automata
Answers
Answered by
0
DFA minimization stands for converting a given DFA to its equivalent DFA with minimum number of states.
Minimization of DFA. ...
Step 1: We will divide Q (set of states) into two sets. ...
Step 2: Initialize k = 1.
Step 3: Find Pk by partitioning the different sets of Pk-1. ...
Step 4: Stop when Pk = Pk-1 (No change in partition)
Minimization of DFA. ...
Step 1: We will divide Q (set of states) into two sets. ...
Step 2: Initialize k = 1.
Step 3: Find Pk by partitioning the different sets of Pk-1. ...
Step 4: Stop when Pk = Pk-1 (No change in partition)
Similar questions