0 votes 0 votes Context sensitive language can be recognized by a Finite state machine Deterministic finite automata Non-deterministic finite automata Linear bounded automata Theory of Computation ugcnetcse-july2018-paper2 theory-of-computation context-sensitive + – Pooja Khatri asked Jul 13, 2018 recategorized Oct 15, 2018 by Pooja Khatri Pooja Khatri 1.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes For context sensitive grammar we need linear bounded autometa abhishekmehta4u answered Jul 13, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Option D Turing Machine recognises ALL Linear Bounded Automata recognises CSL , CFL , RL Push down automata recognises CFL , RL Finite Automata recognises only RL yuviabhi answered Aug 29, 2018 yuviabhi comment Share Follow See all 0 reply Please log in or register to add a comment.