Redirected
recategorized by
3,658 views
2 votes
2 votes

Which of the following statements is false?

  1. Every context-sensitive language is recursive
  2. The set of all languages that are not recursively enumerable is countable
  3. The family of recursively enumerable language is closed under union
  4. The families of recursively enumerable and recursive languages are closed under reversal
recategorized by

2 Answers

0 votes
0 votes
B is false because all languages which are not recursive enumarable are countable it is not true.
Answer:

Related questions

1 votes
1 votes
7 answers
2
go_editor asked Mar 24, 2020
1,450 views
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$?$\{\in \}$$\{\in,1\}$$\phi$$1^{...