1,940 views
1 votes
1 votes
The minimum number of states required to construct a DFA that recognizes the language of string that recognizes the language of string over alphabet {0,1} whose 10th symbol from the right end is 1 is ____________

1 Answer

0 votes
0 votes

it cannot be minimized below 210 because its goal is to remember sequence of all those possible 10 bits so for remembering those 10 bits we need 210 states

Related questions

0 votes
0 votes
2 answers
2
Manuj_og asked May 2, 2023
210 views
on seeing a dfa how can we predict the number of states in it?
3 votes
3 votes
1 answer
3
abhinowKatore asked Jan 14, 2023
530 views
Please explain what is difference between $\overline{L(N)}$ and $L(\overline{N}$) ?
0 votes
0 votes
1 answer
4
Dknights asked Nov 19, 2022
317 views
can we solve it with a minimum of 4 states?