Context-Sensitive-Grammar

Question 1
CSG can be recognized by
A
push-down automata
B
2 way linear bounded automaton
C
finite state automata
D
none of these
Theory-of-ComputationContext-Sensitive-GrammarTNPSC-2012-Polytechnic-CS
Question 1 Explanation: 
Context sensitive grammar can be recognized by linear bounded automata.
There is 1 question to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access