Menu

Epsilon Moves Questions

MCQ
1.
S
forum Discussion
MCQ
2.
Which one of the following languages over the alphabet {0, 1} is described by the regular expression?

(0+1)*0(0+1)*0(0+1)*
forum Discussion
MCQ
3.
Which one is a FALSE statement?
forum Discussion
MCQ
4.
Match the following.

    Group 1                       Group 2
P. Regular expression        1. Syntax analysis
Q. Pushdown automata         2. Code generation
R. Dataflow analysis         3. Lexical analysis
S. Register allocation       4. Code optimization
forum Discussion
MCQ
5.
Let L = L1 ? L2, where L1 and L2 are languages as defined below.
L1 = {ambmcanbn | m, n >= 0 }
L2 = {aibjck | i, j, k >= 0 }
Then L is?
forum Discussion
MCQ
6.
Convert the NFA to DFA.

forum Discussion
MCQ
7.
Does epsilon ring any change in the automata.
forum Discussion
MCQ
8.
NFA-?s are defined because certain properties can be more easily proved on them as compared to NFA.
forum Discussion
MCQ
9.
E(q) is known ?-closure of q.
forum Discussion
MCQ
10.
?-transitions does not add any extra capacity of recognizing formal.
forum Discussion
Page 1 of 2Next chevron_right