PrepBharat

1. 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

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

View Answer

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

View Answer

4. 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

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

View Answer

6. Like DFAs, NFAs only recognize regular languages.
a) True
b) False

View Answer

7. Can a DFA simulate NDFA?
a) No
b) Yes
c) Sometimes
d) Depends on NDFA

View Answer

8. Find the wrong statement?
a) The language accepted by finite automata are the languages denoted by regular expression
b) Every DFA has a regular expression denoting its language
c) For a regular expression r, there does not exists NDFA with L® ant transit that accept
d) None of the mentioned

View Answer

9. Regular expression a/b denotes which of the following set?
a) {a}
b) {€,a,b}
c) {a,b}
d) {ab}

View Answer

10. Which behaviour of a NFA can be stimulated by DFA?
a) Always
b) Sometimes
c) Never
d) Depends on NFA

View Answer