LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
L1= {w | w does not contain the string tr } L2= {w | w does contain the string tr} Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?
|
|
0
|
|
|
1
|
|
|
2
|
|
|
3
|
Explanation:
There is 1 question to complete.