adplus-dvertising
frame-decoration

Question

What the following DFA accepts?

a.

x is a string such that it ends with ‘101’

b.

x is a string such that it ends with ‘01’

c.

x is a string such that it has odd 1’s and even 0’s

d.

x is a strings such that it has starting and ending character as 1

Answer: (a).x is a string such that it ends with ‘101’

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What the following DFA accepts?

Similar Questions

Discover Related MCQs

Q. What does the following figure most correctly represents?

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

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

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

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

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

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

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

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

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 < _______________

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}

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}

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

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

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

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

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}

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

Q. Choose the correct option for the given statement:

Statement: The DFA shown represents all strings which has 1 at second last position.

Q. According to the given table, compute the number of transitions with 1 as its symbol but not 0:

Q. From the given table, δ*(q0, 011) =?