Register

#TOC DFA Question

1,629 views
3 3 votes
The minimum possible number of states and number of final states of a DFA that accepts the regular language $L = \{w_1aw_2 \mid w_1,w_2 ∈ \{a,b\}^∗, |w_1|=2,|w_2|\leq 3\}$ is ______________ .

2 Answers

0 0 votes

This will have 8 states in all (including a trap state) and has 4 final states.

You may refer to this regex:

(a+b)(a+b)a(a+b)?(a+b)?(a+b)?

'?' means 0 or 1 since  |w2| <=3 

Voting & Accepting an answer helps improve the community
← Previous · language (TM)Next → · MadeEasy WorkBook: D...
← Previous in category · language (TM)Next in category → · pushdown automata
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
4.1k
4.1k views
sripo asked Nov 6, 2018
4,104 views
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
0 0 votes
2 2 answers
2.2k
2.2k views
iarnav asked Mar 14, 2019
2,233 views
#TOC What will be the minimal DFA of this regular language?
Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.
1 1 vote
0 0 answers
576
576 views
paressep28 asked Apr 25, 2024
576 views
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved?
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...