12. Additional Problem 5-12 (JFLAP variation on Textbook page 767 #2 (all parts)) Use your wits to construct a DFA for each of the following expressions. You should assume that the alphabets for each just whatever symbols that I used in that question, e.g. as for the regular expression a+b is fab) and the alphabet for the expression ab +c is {a,b,c} Note 1 - these are the same regular expression previous problem! Note 2 - each of these subproblems should be do in JFLAP. Do NOT include the answer in your regular homewo each of the following regular phabets for each language are estion, e.g. assume the alphabet alphabet for the regular the same regular expressions you described in the ach of these subproblems should be done by creating DEAS answer in your regular homework pdf, mistead, each one should be included as a separate file in jff format with names as specified in fuchsia below that you will add to the zip file you upload Note 3 - Make sure that when you build these they REALLY ARE DFAS. JFLAP won't complain if you have multiple outputs for the same letter from a single node, or forget to put outputs for all the letters in a particular node, but I will!! Note 4 - Once you've made a machine, test it using the list of strings you created in problem 11 a. a + b ( Save as
_additional5-12_a.jff ) b. a + bc ( Save as _additional5-12_b.jff ) c. a + b* (Save as _additional5-12_c.jff ) d. ab* + c( Save as _additional5-12_d.jff ) e. ab* + bc* ( Save as _additional5-12_e.jff ) f. a*bc* + ac( Save as _additional5-12_f.jff ) (Save as _additional5-12 g.jff ) g. a*b* h. a* + b* 12. Additional Problem 5-12 (JFLAP variation on Textbook page 767 #2 (all parts)) Use your wits to construct a DFA for each of the following expressions. You should assume that the alphabets for each just whatever symbols that I used in that question, e.g. as for the regular expression a+b is fab) and the alphabet for the expression ab +c is {a,b,c} Note 1 - these are the same regular expression previous problem! Note 2 - each of these subproblems should be do in JFLAP. Do NOT include the answer in your regular homewo each of the following regular phabets for each language are estion, e.g. assume the alphabet alphabet for the regular the same regular expressions you described in the ach of these subproblems should be done by creating DEAS answer in your regular homework pdf, mistead, each one should be included as a separate file in jff format with names as specified in fuchsia below that you will add to the zip file you upload Note 3 - Make sure that when you build these they REALLY ARE DFAS. JFLAP won't complain if you have multiple outputs for the same letter from a single node, or forget to put outputs for all the letters in a particular node, but I will!! Note 4 - Once you've made a machine, test it using the list of strings you created in problem 11 a. a + b ( Save as _additional5-12_a.jff ) b. a + bc ( Save as _additional5-12_b.jff ) c. a + b* (Save as _additional5-12_c.jff ) d. ab* + c( Save as _additional5-12_d.jff ) e. ab* + bc* ( Save as _additional5-12_e.jff ) f. a*bc* + ac( Save as _additional5-12_f.jff ) (Save as _additional5-12 g.jff ) g. a*b* h. a* + b*
