Register

Find the number of final states in DFA that recognizes L, where L= {w1a w2:|w1|≥3,|w2|≤5}, ∑={a, b} and w1, w2 ∈ ∑ * ______

362 views

1 Answer

0 votes
0 votes

The DFA will be made as follows:

So we accept any number of {a, b} greater than 3, then we wait until we get the ‘a’. After that accept any {a, b} upto count of 5 but not more than 5. Notice q10 is a trap state.

Answer: Hence we have 6 final states.

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

Related questions

0 votes
0 votes
0 answers
2
koushriek asked May 19, 2022
1,400 views
Number of states in a DFA that accepts the language over the alphabet{0,1} where words start and end with a '1', have even length and where any 0 in the word is immediately followed by at least a 1.
Examples of accepted words: 1011, 101101, 1111Example of non-accepted words: 101, 1001, 010The solution says the min-DFA contains 5 states but I could only do it in 4. Am...
User Avatar
1 votes
1 votes
1 answer
3
kislaya Pant asked May 8, 2018
1,162 views
Minimal Final States in DFA
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4).
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4)....
User Avatar
3 votes
3 votes
1 answer
4
rahul sharma 5 asked Aug 4, 2017
1,338 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
Link Copied!