A context sensitive language is accepted -1 :by * Finite automata O linear bounded automata Turing machine None of them * :A grammar G=(V,T,P,S) in which V is -2 None of these O set of terminals set of variables and terminals set of variables

Theory that deals with fundamental questions around what problems can and cannot be solved using computation and uses a model of computation to understand the degree to which computers can assist in solving problems. There are three main branches of this subject: automata theory and formal languages, computational complexity theory, and computability theory.