Question

1. [10 marks total - 2 marks each] For each of the following languages, draw a state diagram for an NFA that recognizes it, assuming the conventions for $a^+$ and $a^n$ as given in class. a. $L_a = \{w \in \{0,1\}^* | w \text{ represents a 4 bit hexadecimal number in the range C to E}\}$ b. $L_b = (22 \cup 130) \circ (21)^+$ c. $L_c = \{cat, dog, cog, dat\}$ d. $L_d = (a \cup ba)^* \circ (bab)^$ e. $L_e = \{w \in \{0,1\}^ | w \text{ begins with 1 and does not contains substring 00}\}$

Name: 1 10 marks total 2 marks each for each of the following languages draw a state diagram for an nfa that recognizes it assuming the conventions for a and an as given in class a la w in 01 w t 12107
Uploaded: 2023-11-11T18:01:15-08:00
Duration: 3 min 43 s
Channel: Akash M
Description: 1 10 marks total 2 marks each for each of the following languages draw a state diagram for an nfa that recognizes it assuming the conventions for a and an as given in class a la w in 01 w t 12107

          1. [10 marks total - 2 marks each] For each of the following languages, draw a state diagram for an NFA that
recognizes it, assuming the conventions for $a^+$ and $a^n$ as given in class.
a. $L_a = \{w \in \{0,1\}^* | w \text{ represents a 4 bit hexadecimal number in the range C to E}\}$
b. $L_b = (22 \cup 130) \circ (21)^+$
c. $L_c = \{cat, dog, cog, dat\}$
d. $L_d = (a \cup ba)^* \circ (bab)^*$
e. $L_e = \{w \in \{0,1\}^* | w \text{ begins with 1 and does not contains substring 00}\}$

1 10 marks total 2 marks each for each of the following languages draw a state diagram for an nfa that recognizes it assuming the conventions for a and an as given in class a la w in 01 w t 12107

Added by John E.

Question

Please give Ace some feedback