UGC-NET | UGC NET CS 2015 Dec – III | Question 27

There are exactly __________ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.
(A) 64
(B) 56
(C) 1024
(D) 5832

Answer: (D)
Explanation: If no. of states is |Q|=n and no of input alphabet is m then

Total number of finite automation required is (n^(n*m))*2^n

Here n=3, m=2

Therefore 5832
Quiz of this Question

Article Tags :

UGC-NET

Recommended Articles

1. UGC-NET | UGC NET CS 2015 Dec – III | Question 20

2. UGC-NET | UGC NET CS 2015 Dec – III | Question 1

3. UGC-NET | UGC NET CS 2015 Dec – III | Question 2

4. UGC-NET | UGC NET CS 2015 Dec – III | Question 49

5. UGC-NET | UGC NET CS 2015 Dec – III | Question 3

6. UGC-NET | UGC NET CS 2015 Dec – III | Question 4

7. UGC-NET | UGC NET CS 2015 Dec – III | Question 5

8. UGC-NET | UGC NET CS 2015 Dec – III | Question 6

9. UGC-NET | UGC NET CS 2015 Dec – III | Question 7

10. UGC-NET | UGC NET CS 2015 Dec – III | Question 8

11. UGC-NET | UGC NET CS 2015 Dec – III | Question 9

12. UGC-NET | UGC NET CS 2015 Dec – III | Question 10

13. UGC-NET | UGC NET CS 2015 Dec – III | Question 11

14. UGC-NET | UGC NET CS 2015 Dec – III | Question 12

15. UGC-NET | UGC NET CS 2015 Dec – III | Question 13

16. UGC-NET | UGC NET CS 2015 Dec – III | Question 14

17. UGC-NET | UGC NET CS 2015 Dec – III | Question 15

18. UGC-NET | UGC NET CS 2015 Dec – III | Question 16

19. UGC-NET | UGC NET CS 2015 Dec – III | Question 17

20. UGC-NET | UGC NET CS 2015 Dec – III | Question 18

21. UGC-NET | UGC NET CS 2015 Dec – III | Question 19

22. UGC-NET | UGC NET CS 2015 Dec – III | Question 21

23. UGC-NET | UGC NET CS 2015 Dec – III | Question 22

24. UGC-NET | UGC NET CS 2015 Dec – III | Question 23

25. UGC-NET | UGC NET CS 2015 Dec – III | Question 24