Theory Of Computation MCQ

Which of the folowing definitions below generates the same language as L, where
L = {xn yn such that n > = 1} ?

I. E —> xEy | xy

II. xy | (x+ xyy+)

III .x+y+

A.	I only
B.	I and II
C.	II and III
D.	II only
	Answer : A Explanation : II generates strings like xxyyy, which are not supposed to be. III generates strings like xyy, which are not supposed to be. I can be verified to generate all the strings in L and only those. Write your comments here: Updating your Comments.. Updating your Comments.. 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.

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement