# Peter Linz Edition 5 Exercise 11.3 Question 3 (Page No. 296)

30 views
Show that the family of context-sensitive languages is closed under union.

## Related questions

1
21 views
Show that the family of context-sensitive languages is closed under reversal.
2
33 views
Without explicitly constructing it, show that there exists a context-sensitive grammar for the language $L=\{www^R: w,u\in\{a,b\}^+,|w|\geq|u|\}$.
3
19 views
$\text{Theorem}:$ Every context-sensitive language $L$ is recursive. For $m$ in Theorem, give explicit bounds for $m$ as a function of $|w|$ and $|V\cup T|$.
Find context-sensitive grammars for the following languages. $(a)$ $L=\{w: n_a(w) = n_b(w) = n_c(w)\}$. $(b)$ $L=\{w: n_a(w) = n_b(w) < n_c(w)\}$.