Theory Of Computation MCQ

If L be set of strings from alphabet, then kleen closure of L is given as

A.	$L^{+}=\bigcup_{i=0}^{.}L^{i}$
B.	$L_{0}=\bigcup_{i=0}^{.}L^{i}$
C.	$L^{*}=\bigcup_{i=0}^{\infty }L^{i}$
D.	$L^{+}=\bigcup_{i=1}^{.}L^{i}$
	Answer : B Explanation : 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