Question

Design an NFA N that recognizes all strings having the second and fourth symbols the same as the last symbol. (a) Give the formal definition of N. (b) Draw the state transition diagram of N. Upload the photo of your answer on paper; make sure that it is read- able, it is not rotated and it is well cropped (i.e. does not contain unnecessary white space, margins, or other objects on the picture).

Answer 1

@ Formeel Deffrition of NFA NPS It Ps 5 tople repousentation (9, , 4,90,F) gps Set of all states = 420,21,22,23,24, 1 95,96,97,98} Z RS alphabet -f216] A transition function : QxE-spl@). - P(Q) is power set of a (90,a) hit (as, a r (20, b) = fq,} (น,6)-3น (2,,a) 2 | (96, b) 797 (2,6) (276) 27,78} (229) 23 (97,a) 27 (22, b) 93 (23,9) 24 (2419) 22 128] (24,6) 24 % ?s starting state=8704 fa final state = {28]

• Z = {0, 6) Ravlay expression is [ [a+hya (a+b) Q (a+ba + (a+b)6(a+b) b la+86) - NTn w to Get OCTO