UGC-NET | UGC NET CS 2018 July – II | Question 37

Context sensitive language can be recognized by a :
(A) Finite state machine
(B) Deterministic finite automata
(C) Non-deterministic finite automata
(D) Linear bounded automata


Answer: (D)

Explanation: Context sensitive language can be recognized by a linear bounded automata.
Context free languages and regular languages are accepted by a push down automata.
So, option (D) is correct.


Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.