The finite automata FA1, and FA2 are shown below in Fig. 1 and Fig. 2 respectively....

   

Transcribed Image Text:

The finite automata FA1, and FA2 are shown below in Fig. 1 and Fig. 2 respectively. They accept the respective languages L1 and L2. a, b x2 FX1 b Figure 1: FA1: The FA accepting the language L. FY1 a, b a, b Y2 Y3 a, b Figure 2: FA2: The FA accepting the language L. (a) Define each of the languages L and L2 in plain English. (b) Give a tabular representation of the finite automaton FA. [4 marks] [4 marks] (c) (i) Starting from FA, and FA2 as shown respectively in Fig. 1 and 2, construct a tabular representation of a finite automaton FA3 which accepts the intersection language L1 L2. [5 marks] (ii) Draw the graphical representation of the intersection finite automaton constructed in (i). Also state in plain English (in one sentence) what language the FA thus constructed accepts. (iii) Starting from the graph constructed in part (ii), draw the graphical representation of the union finite automaton, i.e. a FA accepting L UL2. Also state in plain English (in one sentence) what language the FA thus constructed accepts. [2 marks] The finite automata FA1, and FA2 are shown below in Fig. 1 and Fig. 2 respectively. They accept the respective languages L1 and L2. a, b x2 FX1 b Figure 1: FA1: The FA accepting the language L. FY1 a, b a, b Y2 Y3 a, b Figure 2: FA2: The FA accepting the language L. (a) Define each of the languages L and L2 in plain English. (b) Give a tabular representation of the finite automaton FA. [4 marks] [4 marks] (c) (i) Starting from FA, and FA2 as shown respectively in Fig. 1 and 2, construct a tabular representation of a finite automaton FA3 which accepts the intersection language L1 L2. [5 marks] (ii) Draw the graphical representation of the intersection finite automaton constructed in (i). Also state in plain English (in one sentence) what language the FA thus constructed accepts. (iii) Starting from the graph constructed in part (ii), draw the graphical representation of the union finite automaton, i.e. a FA accepting L UL2. Also state in plain English (in one sentence) what language the FA thus constructed accepts. [2 marks]