Theory of Computation MCQ: How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

How many strings of length less than 4 contains the language described by the regular expression (x+y)y(a+ab)?

Correct Answer: 11

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

WhatsApp+91 99922 70404Theory of Computation MCQ: How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*? | Extra Education