Given the language L = {(ab)²n|n ≥ 1} and a pumping length of 5. o Provide string that belongs to L (1mk) Provide a part
Posted: Fri Jul 08, 2022 6:45 am
Given the language L = {(ab)²n|n ≥ 1} and a pumping length of 5. o Provide string that belongs to L (1mk) Provide a partition of string (given in part a) to prove it is not context-free (2mks) o State yes or no for the two values of i below (1mk) If i=0 is the pumped string still a member of L a. If i=2 is the pumped string still a b. member of L