Question: Problem 3 [ 16 marks] For each of the given alphabets, draw a FSM diagram that accepts (ends up at an accepting state) the following

Problem 3 [ 16 marks] For each of the given alphabets, draw a FSM diagram that accepts (ends up at an accepting state) the following language descriptions:

c) [3] Let ={ 0, 1 } be the alphabet: The language that accepts the language that the number of 0s mod 3 is equal to the number of 1s mod 3. For example, the following string 0010010100110 will be accepted as there are five 1s and eight 0s and 5 mod 3 == 8 mod 3.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!