Question No. 4
• Let the class of language
accepted by finite state machine be L1
and the class of languages
represented by regular expressions
be L2 then
Answer
A. L1<L2
B. L1 >=L2
C. L1 U L2 = .*
D. L1=L2
Skip
Save & Next
Previous
1
Answers
Answered by
0
Answered:
Explanation:
By the
Similar questions