question archive Consider an NFA that recognize the set of all binary strings that have either the number of 0's odd, or the number of 1's not a multiple of 3, or both
Consider an NFA that recognize the set of all binary strings that have either the number of 0's odd, or the number of 1's not a multiple of 3, or both
Subject:Computer SciencePrice: Bought3
Consider an NFA that recognize the set of all binary strings that have either the number of 0's odd, or the number of 1's not a multiple of 3, or both.
1. Draw the NFA with clear markings of all states including start and acceptance state(s).
2. Simulate the NFA to show that string 01001 will be accepted by the NFA
3. Simulate the NFA to show that string 010101 will not be accepted by the NFA
