Answer Happy

Posted: **Tue Apr 12, 2022 10:19 am**

: 2 Nfa Exercises A Give An Nfa With Seven States That Accepts The Following Language L L W 0 1 W Contains T 1 (17.74 KiB) Viewed 26 times

2. NFA exercises. a. Give an NFA with seven states that accepts the following language L: L = {w€ {0, 1}* | w contains the substring 11, or w is a multiple of 3 } b. Let I = {0,1}, and let L = {0}. Show that there is no NFA N with exactly one state such that L(N)=L. w