Condensation lemma

The Condensation Lemma is a result in the context of automata theory and formal languages, particularly concerning context-free grammars and their equivalence. It mainly states conditions under which certain types of grammars can be simplified without losing their generative power. In a broader sense, the lemma is often framed as follows: 1. **Grammar Definitions**: Consider a context-free grammar (CFG) that generates a language.