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) xyxyx
Correct Answer:
Verified
Q27: Consider the following statements
I. Recursive languages are
Q28: Recursively enumerable languages are not closed under
A)Union
B)homomorphism
C)complementation
D)concatenation
Q29: Which of the following problem is undecidable?
A)Membership
Q30: Recursive languages are
A)A proper superset of CFL
B)Always
Q31: Consider the following problem x. Given a
Q33: Given A = {0,1} and L =
Q34: If L1 and L2 are context free
Q35: The logic of pumping lemma is a
Q36: For two regular languages L1 = (a
Q37: Pumping lemma is generally used for proving
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents