adplus-dvertising
frame-decoration

Question

Given Language:
Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}

How many state are required to execute L3 using NFA?

a.

16

b.

15

c.

8

d.

7

Answer: (b).15

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Given Language: Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1} How many state are required to execute L3 using NFA?

Similar Questions

Discover Related MCQs

Q. If L is a regular language, Lc and Lr both will be:

Q. In NFA, this very state is like dead-end non final state:

Q. We can represent one language in more one FSMs, true or false?

Q. The production of form non-terminal -> ε is called:

Q. Which of the following is a regular language?

Q. Which of the following recognizes the same formal language as of DFA and NFA?

Q. Under which of the following operation, NFA is not closed?

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

Q. Which of the following is an application of Finite Automaton?

Q. John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?

Q. Which of the following do we use to form an NFA from a regular expression?

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

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

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?

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

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}

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

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

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.

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