**1.**

Can a DFA simulate NDFA?

**2.**

Find the wrong statement?

**3.**

Regular expression a/b denotes which of the following set?

**4.**

Which behaviour of a NFA can be stimulated by DFA?

**5.**

For any DFA state {qi,qj…qm} If some qj is a final state in the NFA Then {qi,qj…qm}, is a final state in the DFA.

**6.**

What is the relation between NFA-accepted languages and DFA accepted languages?

**7.**

In regular expressions, the operator ‘*’ stands for?

**8.**

A deterministic finite automation (DFA)D with alphabet ∑ = {a,b} is given below. Which of the following is a valid minimal DFA which accepts the same language as D?

**9.**

The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

**10.**

Is empty string a valid input in Ndfa.