COMPILER DESIGN

LEXICAL ANALYSIS

REGULAR EXPRESSIONS AND FINITE AUTOMATA

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
A DFA M1 takes T1 unit time and a NFA M2 takes T2 unit time in recognizing of a regular expression r, then
A
T1<=T2
B
T1=T2
C
T2>=T1
D
T1<T2
Explanation: 
There is 1 question to complete.