adplus-dvertising
frame-decoration

Question

Given Language L= {xϵ {a, b}*|x contains aba as its substring}
Find the difference of transitions made in constructing a DFA and an equivalent NFA?

a.

2

b.

3

c.

4

d.

Cannot be determined.

Answer: (a).2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Given Language L= {xϵ {a, b}*|x contains aba as its substring} Find the difference of transitions made in constructing a DFA and an equivalent NFA?

Similar Questions

Discover Related MCQs

Q. The construction time for DFA from an equivalent NFA (m number of node)is:

Q. If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?

Q. Which of the following option is correct?

Q. The number of tuples in an extended Non Deterministic Finite Automaton:

Q. What is wrong in the given definition?
Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})

Q. If δ is the transition function for a given NFA, then we define the δ’ for the DFA accepting the same language would be:
Note: S is a subset of Q and a is a symbol.

Q. What is the relation between DFA and NFA on the basis of computational power?

Q. If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there exists a sequence of states r0, r1, r2…… rn such that δ(r(i), si+1) =ri+1 for each 0, 1, …n-1, then r(n) is:

Q. Subset Construction method refers to:

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?

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?