Recent questions tagged number-of-states

0 votes
2 answers
3
on seeing a dfa how can we predict the number of states in it?
0 votes
2 answers
5
3 votes
4 answers
6
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________.// doubt: minimal strin...
0 votes
2 answers
7
0 votes
1 answer
11
Number of $2$ state DFA with designated initial state can be constructed over alphabet $\sum_{.}^{.}=\left \{ 0,1 \right \}$ and that accept empty language $\Phi$ is____...
0 votes
1 answer
13
Minimum states required for DFA that accepts : L = {w1 x w2 | w,x belongs to {a,b}* | w1 >= 0, w2 1 and x >= 0 }.
0 votes
1 answer
15
Construct the Minimum FA that accepts all the string of 0's and 1's whereA)Every String start and end with Zero.B)Every string Start and end with Same Symbol.
0 votes
0 answers
16
1 votes
1 answer
18
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)....
1 votes
1 answer
19
1 votes
0 answers
20
1 votes
2 answers
21
3 votes
2 answers
22
2 votes
0 answers
23
Consider the following grammar:$S\rightarrow aA|bB$$A\rightarrow aA|bB$$B\rightarrow bB|ϵ$Then the number of states in a minimal D.F.A of the above grammar is __________...
2 votes
2 answers
25
$ L\ =\ \{\ a^mb^{2n}c^{3n}d^p\ |\ m,n\ >=1\ ,\ p\ >\ m\} \\Find\ the\ number\ of\ strings\ of\ length\ <=\ 13$
0 votes
2 answers
28