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<l2
(b) L1>=L2
(c) L1 U L2 = .*
(d) L1=L2
This question was posed to me during an online exam.
This is a very interesting question from Regular Grammar in division Contextfree Grammar and Syntax Analysis of Compiler