Theory of Computation (Automata)

Select the accurate description of Context-sensitive language.

• A. The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.
• B. A class of formal languages recognized by a linear-bounded automaton, more powerful than context-free languages. ✓
• C. A property used to prove that certain languages are not regular by showing they cannot be 'pumped' while remaining in the language.
• D. A finite-state machine whose output values are determined solely by its current state.