Construct a NFSA with at least one s-moves to accept each of the following languages. (a)...

Transcribed Image Text:

Construct a NFSA with at least one s-moves to accept each of the following languages. (a) {we{0,1}* |w corresponds to the binary encoding of a positive integer that is divisible by 16 or is odd}. (b) {a"ba" | m, n20 and n%3 = m%3} For instance, b, aba, aabaa, aaab, abaaaa, aaaaabaa are in the language, but abaa is not. Construct a NFSA with at least one s-moves to accept each of the following languages. (a) {we{0,1}* |w corresponds to the binary encoding of a positive integer that is divisible by 16 or is odd}. (b) {a"ba" | m, n20 and n%3 = m%3} For instance, b, aba, aabaa, aaab, abaaaa, aaaaabaa are in the language, but abaa is not.