adplus-dvertising
frame-decoration

Question

Fill the missing blank in the given Transition Table:

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

a.

Q0

b.

Q1

c.

Q2

d.

No Transition

Answer: (b).Q1

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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}

Similar Questions

Discover Related MCQs

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) =?

Q. Number of times the state q3 or q2 is being a part of extended 6 transition state is

Q. Predict the missing procedure:

1.Δ(Q0, ε) ={Q0},
2.Δ(Q0, 01) = {Q0, Q1}
3.δ(Q0, 010) =?

Q. Which of the following does the given NFA represent?

Q. The number of transitions required to convert the following into equivalents DFA:

Q. Which among the following NFA’s is correct corresponding to the given Language?
L= {xϵ {0, 1} | 3rd bit from right is 0}

Q. Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?

Q. An e-NFA is ___________ in representation.

Q. State true or false:
Statement: Both NFA and e-NFA recognize exactly the same languages.

Q. Which of the following belongs to the epsilon closure set of a?

Q. The number of elements present in the e-closure(f2) in the given diagram:

Q. If R represents a regular language, which of the following represents the Venn-diagram most correctly?