If L and P are two recursively enumerable languages, then th

Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

Coming Soon

77

M: +3.00/-1.00

If L and P are two recursively enumerable languages, then they are not closed under

[ISRO CS May 2017]

A Kleene Star L * of L

B

C

D Set difference