Theory of Computation MCQ: Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?

Let S and T be language over ={a,b} represented by the regular expressions (a+b) and (a+b)*, respectively. Which of the following is true?

Correct Answer: S=T

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