Recent questions tagged minimal-state-automata

4 votes
2 answers
31
0 votes
1 answer
33
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00or 11.
0 votes
1 answer
37
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�...
0 votes
2 answers
38
3 votes
4 answers
39
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...
3 votes
1 answer
40
in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state
0 votes
1 answer
42
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA?Please elaborate.
0 votes
0 answers
47
1 votes
1 answer
48
0 votes
1 answer
50
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
51
What will be the minimum no. of states for DFA for the above NFA? Please explain.
1 votes
1 answer
52
If two finite state machines M and N are isomorphic then M can be transformed to N by relabeling(a) the states alone(b) the edges alone(c) both the states and edges(d) no...
0 votes
1 answer
53
0 votes
1 answer
54
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
0 answers
56
construct the minimul FA, that accepts all the string of 0's and 1'sA)The second symbol from the right end of the string is 0B)The third symbol from the right end of the ...
0 votes
1 answer
57
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
58