adplus-dvertising
frame-decoration

Question

The behaviour of NFA can be simulated using DFA.

a.

always

b.

never

c.

sometimes

d.

none of the mentioned

Answer: (a).always

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The behaviour of NFA can be simulated using DFA.

Similar Questions

Discover Related MCQs

Q. It is suitable to use ____________ method/methods to convert a DFA to regular expression.

Q. State true or false:
Statement: For every removed state, there is a regular expression produced.

Q. Is it possible to obtain more than one regular expression from a given DFA using the state elimination method?

Q. A regular language over an alphabet a is one that can be obtained from

Q. Regular expression {0,1} is equivalent to

Q. Precedence of regular expression in decreasing order is

Q. Regular expression Φ* is equivalent to

Q. a? is equivalent to

Q. ϵL is equivalent to

Q. (a+b)* is equivalent to

Q. ΦL is equivalent to

Q. Which of the following pair of regular expression are not equivalent?

Q. Consider following regular expression

i) (a/b)*
ii) (a*/b*)*
iii) ((ϵ/a)b*)*

Which of the following statements is correct

Q. What kind of expressions do we used for pattern matching?

Q. Which of the following do Regexps do not find their use in?

Q. Which of the following languages have built in regexps support?

Q. The following is/are an approach to process a regexp:

Q. Are the given two patterns equivalent?
(1) gray|grey

(2) gr(a|e)y

Q. Which of the following are not quantifiers?

Q. Which of the following cannot be used to decide whether and how a given regexp matches a string: