Q. Which of the steps are non useful while eliminating the e-transitions for the given diagram?

View solution

Q. Remove all the epsilon transitions in the given diagram and compute the number of a-transitions in the result?

View solution

Q. What the following DFA accepts?

View solution

Q. What does the following figure most correctly represents?

View solution

Q. Which of the following will not be accepted by the following DFA?

View solution

Q. Which of the following will the given DFA won’t accept?

View solution

Q. Which of the following is the corresponding Language to the given DFA?

View solution

Q. Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization of DFA?

View solution

Q. For the DFA given below compute the following:
Union of all possible combinations at state 7,8 and 9.

View solution

Q. Given Language: L= {xϵ∑= {a, b} |x has a substring ‘aa’ in the production}. Which of the corresponding representation notate the same?

View solution

Q. Let u=’1101’, v=’0001’, then uv=11010001 and vu= 00011101.Using the given information what is the identity element for the string?

View solution

Q. Which of the following substring will the following notation result?

View solution

Q. Predict the following step in the given bunch of steps which accepts a strings which is of even length and has a prefix=’01’
δ (q0, ε) =q0 < δ(q0,0) =δ (δ (q0, ε),0) =δ(q0,0) =q1 < _______________

View solution

Q. Fill the missing blank in the given Transition Table:

Language L= {xϵ∑= {0,1} |x accepts all the binary strings not divisible by 3}

View solution

Q. Which among the following is the missing transition in the given DFA?
L= {xϵ∑= {a, b} | x starts with a and ends with b}

View solution

Q. The complement of a language will only be defined when and only when the __________ over the language is defined.

View solution

Q. Which among the following is not notated as infinite language?

View solution

Q. Which among the following states would be notated as the final state/acceptance state?

L= {xϵ∑= {a, b} | length of x is 2}

View solution

Q. Which of the following are the final states in the given DFA according to the Language given ?
L= {xϵ∑= {a, b} |length of x is at most 2}

View solution

Q. Which of the following x is accepted by the given DFA (x is a binary string ∑= {0,1})?

View solution