
3. (30 points) Design a CFG for each of the following languages: a) Li-(aibi#1 (iメj), where i,j,k2 0} b) La = {a’Vck I (1メk } c) L3-(aw#1 (i j or i € k), } d) The set of all strings over alphabet (a, b) such that the number of a’s is at least as ), where i, j,k 2 0 where i, j,k 2 0 many as the number of b’s. e)
PayPal Gateway not configured
PayPal Gateway not configured