Foundations of Computer Science

Would anyone help me to this HM...

draw the DFA:

3

2 The Language L To precisely specify L. first define= {a,b,c, ,z) as the set of lower-case Roman letters. Also, define -{.) and -: {@ . and let -r . .e. is the set consisting of all the lower-case Roman letters, the dot (or period), and the Q symbol. Define the following sets of strings Sl-: *, which consists of strings over of length one or more . S2-. ". which consists of strings starting with a dot and followed by one or more symbols from Then we define the following sets of strings over L= L1 U L2 The sets L1 and L2 include (some but not all) email addresses. For example, the string abconjit.com belongs to L1. The strings abconjit.com, abc.def0cs.njit.com, and abc.def.gCa.b.cs.njit.com are in L2 The specification of L does not include all valid email addresses because we included several restrictions to simplify the assignment. For example, only lower-case Roman letters, dots, and the Q symbol are allowed, strings in L must end with .com, etc First construct a DFA M (Q, . .91, F) that recognizes L. The DFA must satisfy each of the following properties: The DFA must be defined with the above alphabet . Your DFA does not have to handle symbols that are not in The states in the DFA must be labeled q1,q2,q3, ,qn, where q is the start state and n is the number of states in the DFA. (It is also acceptable for the states to be labelec qo, q1,. .. . qn-1, with qo the start state.) You will lose points if your DFA is overly complicated. To simplify your DFA drawing, you may omit any edges going from any state q to a "trap state" (i.e., a non-accepting state from which the DFA can never leave). All other edges must be included in your drawing. Clcarly identify which statc is thc trap statc in the drawing of your DFA, and your drawing should include a note stating that all edges not specified go to a trap state Also, to simplify your drawing, you may define the set =- for any symbol 1 E ie., -1 is the set of all lower-case Roman letters except for 1. For exarnple. T-c-fa, b, d, e, ,z], so your DFA might include something like the following: qk Thus, if the DFA is currently in state qi, then it moves to gj on reading the letter c, and it moves to state qk on reading any other lower-case Roman letter. You could also define the notation -a,o-_ {a. o} 2 The Language L To precisely specify L. first define= {a,b,c, ,z) as the set of lower-case Roman letters. Also, define -{.) and -: {@ . and let -r . .e. is the set consisting of all the lower-case Roman letters, the dot (or period), and the Q symbol. Define the following sets of strings Sl-: *, which consists of strings over of length one or more . S2-. ". which consists of strings starting with a dot and followed by one or more symbols from Then we define the following sets of strings over L= L1 U L2 The sets L1 and L2 include (some but not all) email addresses. For example, the string abconjit.com belongs to L1. The strings abconjit.com, abc.def0cs.njit.com, and abc.def.gCa.b.cs.njit.com are in L2 The specification of L does not include all valid email addresses because we included several restrictions to simplify the assignment. For example, only lower-case Roman letters, dots, and the Q symbol are allowed, strings in L must end with .com, etc First construct a DFA M (Q, . .91, F) that recognizes L. The DFA must satisfy each of the following properties: The DFA must be defined with the above alphabet . Your DFA does not have to handle symbols that are not in The states in the DFA must be labeled q1,q2,q3, ,qn, where q is the start state and n is the number of states in the DFA. (It is also acceptable for the states to be labelec qo, q1,. .. . qn-1, with qo the start state.) You will lose points if your DFA is overly complicated. To simplify your DFA drawing, you may omit any edges going from any state q to a "trap state" (i.e., a non-accepting state from which the DFA can never leave). All other edges must be included in your drawing. Clcarly identify which statc is thc trap statc in the drawing of your DFA, and your drawing should include a note stating that all edges not specified go to a trap state Also, to simplify your drawing, you may define the set =- for any symbol 1 E ie., -1 is the set of all lower-case Roman letters except for 1. For exarnple. T-c-fa, b, d, e, ,z], so your DFA might include something like the following: qk Thus, if the DFA is currently in state qi, then it moves to gj on reading the letter c, and it moves to state qk on reading any other lower-case Roman letter. You could also define the notation -a,o-_ {a. o}