Description
I will give non-regular exercises for you to try (remember, you must work on these besides following my lectures or read book sections!). These will not be graded. Solutions will be posted on D2L a bit later.
Problem 1
Let = fa; bg. Construct a CFG for the following language:
(1.1) A = fwj the length of w is oddg.
(1.2) B = fwj w has at least three a0 sg.
(1.3) C = fwj w is a palindromeg.
