191 views

1 Answer

Best answer
6 votes
6 votes

This Language says, that last 3rd digit is a always and all others can be either a or b.

So, Minimized DFA has $2^{3}$ states = $8$ states

Property :- When $nth$ character from the last is always either 0 or 1(I your case always a or b), then Minimal DFA has $2^{n}$ states.


You can try to design a DFA.


A lookalike https://gateoverflow.in/65645/mininmal-dfa

selected by

Related questions

3 votes
3 votes
1 answer
1
abhinowKatore asked Jan 14, 2023
531 views
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
1 votes
1 votes
1 answer
3
srestha asked Apr 23, 2019
933 views
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________Answer will be...
0 votes
0 votes
1 answer
4
Lakshman Bhaiya asked Dec 27, 2018
543 views
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a�...