1.

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(c) L1 U L2 = .*(d) L1=L2

Answer» Right option is (d) L1=L2

The best explanation: Finite state machine and regular expression have same power to express a language.


Discussion

No Comment Found

Related InterviewSolutions