Q. Which among the following can be an example of application of finite state machine(FSM)?

View solution

Q. Which among the following is not an application of FSM?

View solution

Q. L1= {w | w does not contain the string tr }
L2= {w | w does contain the string tr}

Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?

View solution

Q. Predict the number of transitions required to automate the following language using only 3 states:
L= {w | w ends with 00}

View solution

Q. The total number of states to build the given language using DFA:
L= {w | w has exactly 2 a’s and at least 2 b’s}

View solution

Q. Given Language: {x | it is divisible by 3}
The total number of final states to be assumed in order to pass the number constituting {0, 1} is

View solution

Q. A binary string is divisible by 4 if and only if it ends with:

View solution

Q. Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc.

View solution

Q. If L1 and L2 are regular languages, which among the following is an exception?

View solution

Q. Predict the analogous operation for the given language:
A: {[p, q] | p ϵ A1, q does not belong to A2}

View solution

Q. Statement 1: NFA computes the string along parallel paths.
Statement 2: An input can be accepted at more than one place in an NFA.

Which among the following options are most appropriate?

View solution

Q. Which of the following options is correct for the given statement?
Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2^k.

View solution

Q. Let N (Q, ∑, δ, q0, A) be the NFA recognizing a language L. Then for a DFA (Q’, ∑, δ’, q0’, A’), which among the following is true?

View solution

Q. There exists an initial state, 17 transition states, 7 final states and one dumping state, Predict the maximum number of states in its equivalent DFA?

View solution

Q. It is less complex to prove the closure properties over regular languages using:

View solution

Q. According to the given transitions, which among the following are the epsilon closures of q1 for the given NFA?
Δ (q1, ε) = {q2, q3, q4}

Δ (q4, 1) =q1

Δ (q1, ε) =q1

View solution

Q. State true or false?
Statement: An NFA can be modified to allow transition without input alphabets, along with one or more transitions on input symbols.

View solution

Q. State true or false?
Statement: ε (Input) does not appears on Input tape.

View solution

Q. Statement 1: ε- transition can be called as hidden non-determinism.
Statement 2: δ (q, ε) = p means from q it can jump to p with a shift in read head.

Which among the following options is correct?

View solution

Q. ε- closure of q1 in the given transition graph:

View solution