Register

Min No of states in FA .

1,507 views

1 Answer

Best answer
5 votes
5 votes

Here I assumed q0 as the initial state . q1 as the final state .q3 as the trap state .

Regular expression for this will be    a+a(a+b)*a

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
smsubham asked Apr 8, 2018
2,656 views
Number of States in FA
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
User Avatar
3 votes
3 votes
1 answer
2
rahul sharma 5 asked Aug 4, 2017
1,314 views
Number of Final states in minimal FA(NFA)
What will be total number of final states in NFA for the given regular expression? $R=(a+b)^{*}b(a+b+\epsilon )$
What will be total number of final states in NFA for the given regular expression?$R=(a+b)^{*}b(a+b+\epsilon )$
User Avatar
0 votes
0 votes
1 answer
3
parthsl asked Jan 27, 2016
705 views
Finding minimum states in FA.
If it is asked for minimum states required in FA for some language, we can have both NFA and DFA, and NFA has lesser number of states but many books write that consider DFA as default. What to take into consideration in such case?NFA or DFA?
If it is asked for minimum states required in FA for some language, we can have both NFA and DFA, and NFA has lesser number of states but many books write that consider D...
User Avatar
1 votes
1 votes
1 answer
4
iarnav asked Aug 18, 2017
1,415 views
Min DFA states?
Consider the regular language L=(00+0000)* . The minimum number of states in any DFA accepting this languages is?
Consider the regular language L=(00+0000)* . The minimum number of states in any DFA accepting this languages is?
User Avatar
Link Copied!