📘 formal languages and automata theory
Step-by-step solutions with LaTeX - clean, fast, and student-friendly.
Union Context Free
1. **Stating the problem:** We are given two context-free languages (CFLs) $L_1$ and $L_2$. We need to prove that their union $L_1 \cup L_2$ is also context-free.
2. **Recall the d