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

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

Correct Answer: L1=L2

Make the most of this question

This page focuses on one Theory of Computation question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation MCQs All Engineering topics Mock test hub