Q.

Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then

A. L1
B. L1>=L2
C. L1 U L2 = .*
D. L1=L2
Answer» D. L1=L2
724
0
Do you find this helpful?
2

View all MCQs in

Theory of Computation

Discussion

No comments yet

Related MCQs