Exercise 4 (Homework 5).
(R (decidable/recursive languages),
RE (semi-decidable/ recursively enumerable languages),
coRE,
complement,
concatenation,
Kleene star,
shift)
Other closure properties of \mathbf{R}, \mathbf{RE}, and \mathbf{coRE}
The goal of this exercise is to see how \mathbf{R}, \mathbf{RE}, and \mathbf{coRE} behave w.r.t. complementation, concatenation, Kleene star, and shift.
Note
Also recall that a class \cal C of languages is closed under a binary operation \circ (e.g., union or concatenation) if, for any A,B\in {\cal C}, it holds that A \circ B \in {\cal C}. Similarly, \cal C is closed under a unary operation \circ (e.g., complement or Kleene star) if for any A \in {\cal C}, it holds that \circ A \in {\cal C}.
Complement.
- Show that \mathbf{R} is closed under complement.
- Show that if A\in \mathbf{RE}, then \overline A\in \mathbf{coRE}.
- Show that if A\in \mathbf{coRE}, then \overline A\in \mathbf{RE}.
Concatenation.
- Show that \mathbf{R} is closed under concatenation.
- Show that \mathbf{RE} is closed under concatenation.
- Is \mathbf{coRE} closed under concatenation?
Kleene star.
- Show that \mathbf{R} is closed under Kleen star.
- Show that \mathbf{RE} is closed under Kleen star.
- Is \mathbf{coRE} closed under Kleene star?
Shift (see Exercise 1.9).
- Show that \mathbf{R} is closed under shift.
- Show that \mathbf{RE} is closed under shift.
- Is \mathbf{coRE} closed under shift?