winter reef
Give a grammar of the highest possible Chomsky type for the following languages on. Name the Chomsky type.
L = {a k b n c m | n, m, k ∈ N + ∧ k ≤ (m + n)}
L = {w ∈ {a, b, c} ∗ | # a (w) MOD 2 = # c (w) MOD 2}
Hint: Modulo (MOD) calculates the remainder b of dividing n by m (n/m = x, remainder b). It is about 7 MOD 2 = 1 and 8 MOD 2 = 0.
thorny orchid