Question 37
37. Context sensitive language can be recognized by a :
Answer : (4) Linear bounded automata 
Subscribe to:
Post Comments (Atom)
Popular Posts
-
The table below embodies data on the production, exports and per capita consumption of rice in country P for the five years from 2012 to 2...
-
Download Admit Card for UGC-NET JUNE 2020 (for examination on 09.10.2020, 17.10.2020) Note : Please refer Revised Date sheet of Examinati...
-
Question 1 1. An organization has a Class B Network and need to form subnet for 64 departments what would be the appropriate Subnet...
-
Visit ugc net paper 2 computer science 2017 ugc net computer science paper 1 solved Exam Year Paper 2018 UGC Paper1 20...
-
Question 1 The number of different spanning trees in complete graph, K4 and bipartite graph, K2,2 have ______ and _______ respectively. 1. 1... -
NTA UGC NET Paper 1 July 2018 UGC NET Paper 1 Question Paper July 2018 Set P solved 1. Which of the following set of statements ... -
1. How many are there to place 8 indistinguishable balls into four distinguishable bins? A 70 B 165 C 8 C 4 D 8 P 4 ANS. B ... -
The NTA UGC-NET November, 2017 Examination was conducted on 5th November by CBSE( Central Board of Secondary Education). The following are ... -
41. 'Fly ash' produced in thermal power plants is an ecofriendly resource for use in: (a) agriculture as micro-nutrient (b) was...
-
Question 25 25. A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.1...
Unrestricted Grammar: Recognized by Turing machine
Context Sensitive Grammar: Recognized by the Linear Bound Automata
Context Free Grammar: Recognized by a Pushdown automata
Regular Grammar: Accepted by a finite state automaton ( Deterministic finite automata & Non-deterministic finite automata)
So, Option (4) is correct answer.