Please do 14.5.2

1 14.5.5 5,1 Explain how to build an N p14 precisely, S is the with L(M)S, where S is any fnite set of strings. (More of strings.) Demonstrate your construction by building an NFA for S whers fnite set of strings) Demonastrate your regular expression denoting the P14.5.2 Define p14.5- two or more letters as well as by single letters. Explain how to replace a multiple-letuer Gne a multiple-letter NFA to be one where transitions may be labeled with strings ot S- aa +baab + ba + bbb. h an equivalent ordinary NFA. (Hint: If (s, abc, t) is a transition, add two states and teo of letter-transitions so th anything that it couldn't do before. Then delete the transition (s,abc,t).) at the NFA can still go from s to t while reading abc, but and new can't do P145.3 Let the NFA K (Fieure 14.1A) han . pl o, only final stat are ther the st Wha K fro abbal 1 14.5.5 5,1 Explain how to build an N p14 precisely, S is the with L(M)S, where S is any fnite set of strings. (More of strings.) Demonstrate your construction by building an NFA for S whers fnite set of strings) Demonastrate your regular expression denoting the P14.5.2 Define p14.5- two or more letters as well as by single letters. Explain how to replace a multiple-letuer Gne a multiple-letter NFA to be one where transitions may be labeled with strings ot S- aa +baab + ba + bbb. h an equivalent ordinary NFA. (Hint: If (s, abc, t) is a transition, add two states and teo of letter-transitions so th anything that it couldn't do before. Then delete the transition (s,abc,t).) at the NFA can still go from s to t while reading abc, but and new can't do P145.3 Let the NFA K (Fieure 14.1A) han . pl o, only final stat are ther the st Wha K fro abbal