Exercise 7.3.3 (b)

Exercise 7.3.3 (c)

Exercise 7.3.4 (d)

Exercise 7.3.4 (e)

Use the CYK algorithm (7.4.4) to determine whether baaab and ababa are in the language defined by the following grammar.

S → AB | BC

A → BA | a

B → CC | b

C → AB | aTrue or false? If L is a CFL then so is {ww

^{R}| w ∈ L}. Give either a proof or a counterexample.