5,677 views

2 Answers

Best answer
4 votes
4 votes

States are  {Q0}  {Q1,Q2,Q3}  {Q4} .

Hence, minimized DFA has 3 states.

RE = (a+b) b*a (a+b)*

selected by

Related questions

1 votes
1 votes
0 answers
1
shaurya vardhan asked Oct 24, 2017
905 views
Given : DFA.Minimum number of states required to construct an equivalent NFA isa)2b)3c)4d)6PS: how can we minimize if initial and final states of DFAare not given ?
1 votes
1 votes
0 answers
2
ankitgupta.1729 asked Feb 25, 2018
569 views
Is minimization of Finite State Machine(FSM) based on Dynamic Programming(DP) paradigm ? If yes , then what should be the optimal substructure and overlapping subproblems...
0 votes
0 votes
1 answer
3
Prasanna asked Jan 24, 2016
746 views
Clear Image URL: http://postimg.org/image/ljcst3k0t/