Theory of Computation MCQ: If a language is denoted by a regular expression L = ( x )* (x y x ), then which of the following is not a legal string within L ?

If a language is denoted by a regular expression L = ( x )* (x y x ), then which of the following is not a legal string within L ?

Correct Answer: xyxyx

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