GATE | GATE CS 1997 | Question 64

Construct a finite state machine with minimum number of states, accepting all strings over {a, b} such that the number of a‘s is divisible by two and the number of b‘s is divisible by three.

Answer:
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post

Article Tags :

GATE

GATE-GATE CS 1997

Recommended Articles

1. GATE | GATE CS 1997 | Question 72

2. GATE | GATE CS 1997 | Question 1

3. GATE | GATE CS 1997 | Question 2

4. GATE | GATE CS 1997 | Question 3

5. GATE | GATE CS 1997 | Question 4

6. GATE | GATE CS 1997 | Question 5

7. GATE | GATE CS 1997 | Question 6

8. GATE | GATE CS 1997 | Question 7

9. GATE | GATE CS 1997 | Question 8

10. GATE | GATE CS 1997 | Question 9

11. GATE | GATE CS 1997 | Question 10

12. GATE | GATE CS 1997 | Question 11

13. GATE | GATE CS 1997 | Question 12

14. GATE | GATE CS 1997 | Question 13

15. GATE | GATE CS 1997 | Question 14

16. GATE | GATE CS 1997 | Question 15

17. GATE | GATE CS 1997 | Question 16

18. GATE | GATE CS 1997 | Question 17

19. GATE | GATE CS 1997 | Question 18

20. GATE | GATE CS 1997 | Question 19

21. GATE | GATE CS 1997 | Question 20

22. GATE | GATE CS 1997 | Question 21

23. GATE | GATE CS 1997 | Question 22

24. GATE | GATE CS 1997 | Question 23

25. GATE | GATE CS 1997 | Question 24