Register

Recent questions tagged minimal-state-automata

0 votes
2 answers
62
Toc DFA
User Avatar
1 votes
2 answers
63
Toc dfa
The minimum number of state in the DFA for the language $L = \{ w \mid (n_a(w)+2n_b(w))mod \hspace{0.1cm} 3<2 \} $ is
The minimum number of state in the DFA for the language $L = \{ w \mid (n_a(w)+2n_b(w))mod \hspace{0.1cm} 3<2 \} $ is
User Avatar
0 votes
2 answers
65
Toc DFA
The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$ $10$ $16$ None
The minimum number of state in the DFA for the language $L = \{ w \mid w \in \{a,b\}^* \text{ w has exactly two a's and at least two b's} \}$ is $9$$10$$16$None
User Avatar
1 votes
1 answer
67
Minimal Final States in DFA
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).
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)....
User Avatar
1 votes
1 answer
69
Number of States in FA
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
User Avatar
1 votes
0 answers
70
Minimization of FSM
Is minimization of Finite State Machine(FSM) based on Dynamic Programming(DP) paradigm ? If yes , then what should be the optimal substructure and overlapping subproblems ?
Is minimization of Finite State Machine(FSM) based on Dynamic Programming(DP) paradigm ? If yes , then what should be the optimal substructure and overlapping subproblems...
User Avatar
24 votes
2 answers
71
GATE CSE 2018 | Question: 6
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true? $k \geq 2^n$ $k \geq n$ $k \leq n^2$ $k \leq 2^n$
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true?$k \geq 2^n...
User Avatar
0 votes
1 answer
72
Minimal DFA
Minimum states if L is Language that accepts (a+b)* (aaa+aab) are ____ My ans : 4 states given ans : 5 states
Minimum states if L is Language that accepts (a+b)* (aaa+aab) are ____My ans : 4 states given ans : 5 states
User Avatar
2 votes
0 answers
74
minimal dfa
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 ______________ ?
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 __________...
User Avatar
2 votes
1 answer
75
#states DFA
The minimum no of states required to construct a DFA accepting the language of binary strings which contain an equal no of (01) and (10) is
The minimum no of states required to construct a DFA accepting the language of binary strings which contain an equal no of (01) and (10) is
User Avatar
0 votes
0 answers
77
[Madeasy] the minimum number of states in DFA for given language
L = (0*1 + 1+ 0) I got minimal DFA with 5 state only, but in their answer, they have mentioned with minimum 6 states.
L = (0*1 + 1+ 0)I got minimal DFA with 5 state only, but in their answer, they have mentioned with minimum 6 states.
User Avatar
0 votes
0 answers
78
No of states in Min DFA
No of states in Min DFA, that accepts (1)* over {0,1} alphabets is 1 states 2 states None of these
No of states in Min DFA, that accepts (1)* over {0,1} alphabets is1 states2 statesNone of these
User Avatar
2 votes
2 answers
80
DFA no of states
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
User Avatar
2 votes
1 answer
82
TOC :- Number of states in DFA
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
User Avatar
5 votes
2 answers
86
How to make a minimal DFA
Draw a minimal DFA which accepts a language L over {a,b} 01 [ ((10) * + 111) * + 0 ] * 1
Draw a minimal DFA which accepts a language L over {a,b}01 [ ((10) * + 111) * + 0 ] * 1
User Avatar
1 votes
0 answers
87
DFA minimization
Given : DFA. Minimum number of states required to construct an equivalent NFA is a)2 b)3 c)4 d)6 PS: how can we minimize if initial and final states of DFAare not given ?
Given : DFA.Minimum number of states required to construct an equivalent NFA isa)2b)3c)4d)6PS: how can we minimize if initial and final states of DFAare not given ?
User Avatar
5 votes
3 answers
88
TOC: Number of states in minimum DFA
I think, there will be 4 states in minimum DFA, following states will be merged in the resulted DFA {q0&q3}, {q4&q5}, {q1&q6}, {q2&q7}
I think, there will be 4 states in minimum DFA, following states will be merged in the resulted DFA{q0&q3}, {q4&q5}, {q1&q6}, {q2&q7}
User Avatar
1 votes
1 answer
89
Theory-of-computation DFA
Design a minimal DFA accepting L={w ; atleast one 'a' in w is not immediately followed by 'b'}
Design a minimal DFA accepting L={w ; atleast one 'a' in w is not immediately followed by 'b'}
User Avatar
0 votes
4 answers
90
minimal DFA
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
construct the minimal DFA for the language L={ 3rd symbol from the R.H.S is 'a'} and ∈={a.b}.
User Avatar
Page: