Compiler Design
Transformation from NFA to DFA
Q.

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. Complete the partially completed DFA that accepts this language is shown below.

The missing arcs in the DFA are
A.  
 B.  
 C.  
 D.  
Similar Questions
1.

Can a DFA simulate NDFA?
A.  

No

 B.  

Yes

 C.  

Sometimes

 D.  

Depends on NDFA
2.

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

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

{a}

 B.  

{€,a,b}

 C.  

{a,b}

 D.  

{ab}
4.

Which behaviour of a NFA can be stimulated by DFA?
A.  

Always

 B.  

Sometimes

 C.  

Never

 D.  

Depends on NFA
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.
A.  

True

 B.  

False
6.

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

>

 B.  

<

 C.  

<

 D.  

<=
7.

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

Concatenation

 B.  

Selection

 C.  

Iteration

 D.  

Iteration
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?
A.  
 B.  
 C.  
 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?
A.  

Finite state automata

 B.  

Deterministic pushdown automata

 C.  

Non-deterministic pushdown automata

 D.  

Turing machine
10.

Is empty string a valid input in Ndfa.
A.  

True

 B.  

True
COMPILER DESIGN TOPICS