Could you please show the construction of the machines? I'm struggling following the word explanations.
Finite State Machines
The following two DFAs, G1 and G2, represent behaviors of a certain discrete-event system. In this question, you are expected to show steps of your construction method for the following parts of the question. You may use software (i.e., JFLAP) to help you with your construction but a single screenshot of the result, without any explanation or construction steps, will not be accepted.
G1
Σ1={a,b}
(a) Construct the composite machine G=G1×G2
(b) Construct the composite machine G = G1 || G2
(c) In this question you are required to develop a machine that accepts/marks the language characterized by L(G1)∪L(G2) (i.e., machine that accepts the union of the two languages).
(d) In this question you are required to develop a machine that accepts/marks the language characterized by L(G1)∩L(G2) (i.e., machine that accepts the intersection of the two languages).
Question 2: Finite State Machines (30 points)
The following two DFAs, G1 and G2, represent behaviors of a certain discrete-event system. In this question, you are expected to show steps of your construction method for the following parts of the question. You may use software (i.e., JFLAP) to help you with your construction but a single screenshot of the result, without any explanation or construction steps, will not be accepted.
G1 G2
Σ1={a,b} Σ2={b,c}
(a) Construct the composite machine G=G1 ∪ G2
(b) Construct the composite machine G=G1|G2
(c) In this question you are required to develop a machine that accepts/marks the language characterized by L(G1)∪L(G2) (i.e., machine that accepts the union of the two languages).
(d) In this question you are required to develop a machine that accepts/marks the language characterized by L(G1)∩L(G2) (i.e., machine that accepts the intersection of the two languages).
