Register

UGC NET CSE | November 2017 | Part 3 | Question: 61

• edited by
374 views
1 votes
1 votes

Which of the following statements is not correct?

  1. Every recursive language is recursively enumerable
  2. $L=\{ 0^n \: 1^n \: 0^n \mid n=1,2,3, \dots \}$ is recursively enumerable
  3. Recursive languages are closed under intersection
  4. Recursive languages are not closed under intersection
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

975
views
3 answers
1 votes
Arjun asked Nov 5, 2017
975 views
UGC NET CSE | November 2017 | Part 3 | Question: 74
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a), (b), (c)
User Avatar
661
views
2 answers
1 votes
Arjun asked Nov 5, 2017
661 views
UGC NET CSE | November 2017 | Part 3 | Question: 73
Consider the following statements:UNIX provides three types of permissionsReadWriteExecuteUNIX provides three sets of permissionspermission for ownerpermission for grouppermission for othersWhich of ... Both (i) and (ii)Neither (i) nor (ii)
User Avatar
1.0k
views
2 answers
1 votes
Arjun asked Nov 5, 2017
1,036 views
UGC NET CSE | November 2017 | Part 3 | Question: 72
The Sigmoid activation function $f(t)$ is defined as$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$t \text{ exp}(-t)$\dfrac{1}{1+ \text{exp} (t)}$\dfrac{1}{1+ \text{exp} (-t)}$
User Avatar
2.1k
views
2 answers
1 votes
Arjun asked Nov 5, 2017
2,135 views
UGC NET CSE | November 2017 | Part 3 | Question: 71
Consider a single perceptron with sign activation function. The perceptron is represented by weight vector $\begin{bmatrix} 0.4 & -0.3 & 0.1 \end{bmatrix}^t$ and a bias ... 5 \end{bmatrix}$ then the output of the perceptron is$1$0$-0.05$-1$
User Avatar
Link Copied!