Compilers Questions and Answers – Non-Deterministic Finite Automata – 2

This set of Compilers Interview Questions and Answers for freshers focuses on “Non – Deterministic Finite Automata – 2”.

1. Conversion of a DFA to an NFA __________
a) Is impossible
b) Requires the subset construction
c) Is Chancy
d) Is nondeterministic
View Answer

2. A regular language corresponds to __________
a) An alphabet
b) Set of strings over an alphabet
c) A DFA only
d) A DFA or an NFA
View Answer

3. An NFA may be converted to a DFA using __________
a) Induction
b) A construction
c) Contradiction
d) Compilation
View Answer

4. The subset construction shows that every NFA accepts a __________
a) String
b) Function
c) Regular language
d) Context-free language
View Answer

5. Construct a NDFA for the following regular expression.

(a∪b)*aba(a∪b)*

a)
b)
c)
d) None of the mentioned
View Answer

6. Which is the application of NFA?
a) A regular language is produced by union of two regular languages
b) The concatenation of two regular languages is regular
c) The Kleene closure of a regular language is regular
d) All of the mentioned
View Answer

7. For every NFA a deterministic finite automaton (DFA) can be found that accepts the same language.
a) True
b) False
View Answer

8. Like DFAs, NFAs only recognize regular languages.
a) True
b) False
View Answer

Sanfoundry Global Education & Learning Series – Compilers.

To practice all areas of Compilers for Interviews, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]