Copy 13 Let L₁ and L2 be two languages over the alphabet \Sigma = (a, b, c), defined as follows. L1 is the set of exactly those strings whose length is odd, but the first symbol and last symbol are different from each other. L2 is the set of exactly those strings whose length is odd and greater than one, but the last symbol is equal to the middle symbol. This problem has three parts: (A), (B) and (C). In each part your task is to construct a complete formal definition of one context free grammar. In your answer space, lay out the three parts clearly, to specify which part of your answer addresses which part of the problem. The three required grammars are as follows. (A): Grammar G₁ that generates L1. (B): Grammar G₂ that generates L2.

Copy 13 Let L₁ and L2 be two languages over the alphabet \Sigma = (a, b, c), defined as follows. L1 is the set of exactly those strings whose length is odd, but the first symbol and last symbol are different from each other. L2 is the set of exactly those strings whose length is odd and greater than one, but the last symbol is equal to the middle symbol. This problem has three parts: (A), (B) and (C). In each part your task is to construct a complete formal definition of one context free grammar. In your answer space, lay out the three parts clearly, to specify which part of your answer addresses which part of the problem. The three required grammars are as follows. (A): Grammar G₁ that generates L1. (B): Grammar G₂ that generates L2.

Elements Of Modern Algebra

8th Edition

ISBN:9781285463230

Author:Gilbert, Linda, Jimmie

Publisher:Gilbert, Linda, Jimmie

Chapter1: Fundamentals

Section1.4: Binary Operations

Problem 4E

See similar textbooks