4,464 views
4 votes
4 votes

 Consider the following statements:

  1. Recursive languages are closed under complementation
  2. Recursively enumerable languages are closed under union
  3. Recursively enumerable languages are closed under complementation

Which of the above statements are true?

  1. I only
  2. I and II
  3. I and III
  4. II and III

1 Answer

Best answer
4 votes
4 votes
  1. Recursive languages are closed under complementation - True.
  2. Recursively enumerable languages are closed under union - True.
  3. Recursively enumerable languages are closed under complementation- False

 

Ans- B.

 

selected by
Answer:

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Jul 5, 2016
22,540 views
To represent hierarchical relationship between elements, which data structure is suitable?DequeuePriorityTreeAll of the above
2 votes
2 votes
2 answers
2
go_editor asked Jul 5, 2016
7,002 views
Which of the following data structure is linear type?StringsListsQueuesAll of the above
2 votes
2 votes
1 answer
3
go_editor asked Jul 5, 2016
4,707 views
Pipelining strategy is called implementinstruction executioninstruction prefetchinstruction decodinginstruction manipulation
2 votes
2 votes
2 answers
4
go_editor asked Jul 5, 2016
1,532 views
Where does a computer add and compare data?Hard diskFloppy diskCPU chipMemory chip