Question

Compute AUB, A* and AοB for the following A and B A=c and B={d} Draw three DFA’s to accept AUB, A* and AοB for the following A and B. A=ab* and B={d} What languages the following two grammars individually generate ? Grammar 1 A → a A → aB B → c B → d Grammar 2 A → aC A → aB B → cB B → ε C → ε Build grammars for each of the following regular languages : Language 1: a*bc Language 2: a+bc*

Answer 1

To compute AUB, find the union of sets A and B. To compute A*, find the Kleene star of set A. To compute AοB, find the concatenation of sets A and B.

Step-by-step explanation:

In order to compute AUB, we need to find the union of sets A and B. Set A is defined as the set of all strings that start with 'a' followed by zero or more 'b' and ending with 'c'. Set B is defined as the set containing the string 'd'. Therefore, the union of A and B is AUB = c', 'd'.

To compute A*, we need to find the Kleene star of set A, which is the set that contains all possible concatenations and repetitions of the strings in set A. Since the set A only has one string, the Kleene star of A is A* = cab*.

To compute AοB, we need to find the concatenation of sets A and B, which is the set that contains all possible concatenations of a string from set A and a string from set B. Since set A only has one string and set B only has one string, the concatenation AοB is AοB = cd'.