Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expre
Posted: Thu Jul 14, 2022 9:07 am
a) L1<l2
b) L1>=L2
c) L1 U L2 = .*
d) L1=L2
b) L1>=L2
c) L1 U L2 = .*
d) L1=L2
Accurate answers. Every time.
https://answerhappy.com/