Question

Please answer part C in detail:

Problem 1: The following two NFAs, G1 and G2, represent behaviors of a certain discrete-event system. In this question, you are expected to show steps of your construction method. You may use software to help you with your construction but a single screenshot of the end result, without any explanation or construction steps, will not be accepted. G1: Marks sequences that end with a suffix bbc G2: Marks sequences that end with a suffix aab 92 52 (a) Construct a single machine G that incorporates both behaviors in G1 and G2, i.e., Lm(G) = Lm(G1) U Lm(G2). This new machine should mark sequences that end with a suffix abc or aab. This machine may be an NFA. (b) Construct an equivalent Deterministic Finite Automaton (DFA) for the NFA in Part (a). (c) Construct a single machine G that incorporates the common behaviors in G1 and G2, i.e., Lm(G) = Lm(G1) n Lm(G2).

Answer 1

a b c 12048=0=0 strings that either This is the ends with NFA bbc" to or find the "aab". (b) DFA for hlar) by Ends with ubben DFA for h(G2) ya abc Ends with "aab" 9 boc Yana ta

so the Dra union for of the h(6) L (6.1) U L (G) will be 2 DFAs. a buc either ends with DFA For übbc" the strings which or "aab" . h(G) = { bbc, abbc abbbc , cbbc, abbbc sacbbc... } hG2) = {aab, qaab, barby caab, abaab, acaab, - 3 hm (G) 2 h (G1) n h (62) = 0 It represents that there are no strings which ends, with both übbe" and "aab", so you can design a machine which accepts no string- a, b, c Ex - -