adplus-dvertising
frame-decoration

Question

Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.

a.

N2

b.

2N

c.

2N

d.

N!

Posted under Compiler Design

Answer: (c).2N

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.

Similar Questions

Discover Related MCQs

Q. Which of the following strings is not generated by the following grammar?
S → SaSbS|ε

Q. Regular expressions can be used only for values of type string and number.

Q. What is the Regular Expression Matching Zero or More Specific Characters

Q. All __________ are automatically treated as regular expressions.

Q. Regular Expressions can be used with XML checkpoints.

Q. Cross compiler is used in Bootstrapping.

Q. Is GCC a cross Complier

Q. The __________ is a technique for building cross compilers for other machines

Q. __________ was developed from the beginning as a cross compiler

Q. If we compile the sam.c file with the command “gcc -o sam sam.c”, then the executable file will be

Q. Which concept of grammar is used in the compiler

Q. A regular expression enables a quick test to determine objects and text strings with undependable values.

Q. RE can be used only for values of type string and number.

Q. You can use RE, if you expect the value of a property to change in an unpredictable way each time its run.

Q. ___________ Are automatically treated as regular expressions.

Q. If a ‘/’ is used before a character that has no special meaning, ‘/’ is ignored.

Q. String generated by
S->aS/bA,

A->d/ccA

Q. If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is _____________

Q. The production of the form no terminal → Λ is said to be null production.

Q. R is said to be reflexive if aRa is true for every a in A;