Theory Of Computation MCQ

1:

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 ?

A.

yx

B.

xyx

C.

x

D.

x y x y x

 

Answer : D

Explanation :

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.