EDIT BY NFSA I MEAN NON DETERMINISTIC FINITIE AUTOMATA Const

EDIT- BY NFSA I MEAN NON DETERMINISTIC FINITIE AUTOMATA.

Construct a NFS A with at least one e-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^n ba^m | m, n greaterthanorequalto 0 and n%3 = m%3} For instance, b, aba, aabaa, aaab, abaaaa, aaaaabaa are in the language, but abaa is not.

Solution

skip the question .......

Walk through all the guidelines once again before working on board and answer accordingly

Ø  Login daily and try to answer as many questions as you can (though there is no minimum or maximum limit, answering decent number of questions per day will be beneficial)

Ø  Please refresh your page when you find a message that there are “no questions in the queue to display”