ISRO Scientist or Engineer Computer Science May 2017 Question 77

Question 77

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



Create a FREE account and get:

  • Download Maths Shortcuts PDF
  • Get 300+ previous papers with solutions PDF
  • 500+ Online Tests for Free

Comments

Register with

OR

Boost your Prep!

Download App