Question

3. (10 points) Consider the following language over the alphabet [0, 1,2) L={ai . . . an I n > 0 and ai <a2,a2 > a3,a3 <G4, ) For example, 0212, 120, and ε are each strings in L; 11 and 20 are not in L. Describe an NFA with 6 states that recognizes L. Draw the state diagram of your NFA in JFLAP, export the image as a png or jpg file, and include it as part of your submission. In addition, briefly justify your construction by explaining the role that each state plays in computations.

**please note that not just 0212 120 and epsion need to work, as the other solution i found ONLY accounted for those. Any sequence following the pattern of increase, decrease, increase, decrease (indefinitely) must work. Thank you!

Answer 1

"Given L: L = {a_1 � a_n