In formal language theory, what distinguishes a context-free grammar from a context-sensitive grammar?

💡 Explanation

A context-free grammar's production rules apply regardless of the surrounding symbols, whereas context-sensitive grammar rules depend on the neighboring context; because of this dependency, context-sensitive grammars are more powerful. Therefore, context defines the key difference, rather than the simplicity, generation, or expression.

• What happens to the row player's payoff when mixed strategies converge to a Nash equilibrium within a two-player game represented by a payoff matrix?
• Which outcome occurs when a context-free grammar (CFG) is used to define a formal language with inherently ambiguous structures?
• If a protein undergoes a conformational change in an enzyme's active site, which consequence follows regarding its binding affinity?
• A cryptographic system uses prime numbers to generate keys. If a key generation algorithm mistakenly uses two numbers that share a common prime factor, which security outcome results?
• An engineer is designing a compiler that translates regular expressions into finite automata. If the regular expression contains nested quantifiers, which effect dominates during automaton construction?
• If 'p' is a prime number greater than 2 in a Diffie-Hellman key exchange, which consequence necessarily follows according to Fermat's Little Theorem?