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

Q. Choose the correct option for the given statement:

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

View solution

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

View solution

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

View solution

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

View solution

Q. Predict the missing procedure:

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. An e-NFA is ___________ in representation.

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. The given NFA corresponds to which of the following Regular expressions?

View solution

Q. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________

View solution

Q. The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1

View solution