GATE | GATE CS Mock 2018 | Set 2 | Question 28

Consider the Deterministic Finite Automaton for input alphabets Σ = {a, b} L = The number of final state(s) will be (A) 2 (B) 1 (C) 3 (D) 6
Answer:(C)
Explanation: We have to Check for all the states where a > b. Say &Sigma = { 0, 1, 2 } Therefore, final states will be = { 10, 20, 21 } Number of final states will be 3.
Quiz of this Question

Article Tags :

GATE

Recommended Articles

1. GATE | GATE CS Mock 2018 | Set 2 | Question 23

2. GATE | GATE CS Mock 2018 | Set 2 | Question 24

3. GATE | GATE CS Mock 2018 | Set 2 | Question 25

4. GATE | GATE CS Mock 2018 | Set 2 | Question 26

5. GATE | GATE CS Mock 2018 | Set 2 | Question 27

6. GATE | GATE CS Mock 2018 | Set 2 | Question 29

7. GATE | GATE CS Mock 2018 | Set 2 | Question 30

8. GATE | GATE CS Mock 2018 | Set 2 | Question 31

9. GATE | GATE CS Mock 2018 | Set 2 | Question 32

10. GATE | GATE CS Mock 2018 | Set 2 | Question 33

11. GATE | GATE CS Mock 2018 | Set 2 | Question 34

12. GATE | GATE CS Mock 2018 | Set 2 | Question 35

13. GATE | GATE CS Mock 2018 | Set 2 | Question 36

14. GATE | GATE CS Mock 2018 | Set 2 | Question 37

15. GATE | GATE CS Mock 2018 | Set 2 | Question 38

16. GATE | GATE CS Mock 2018 | Set 2 | Question 39

17. GATE | GATE CS Mock 2018 | Set 2 | Question 40

18. GATE | GATE CS Mock 2018 | Set 2 | Question 41

19. GATE | GATE CS Mock 2018 | Set 2 | Question 42

20. GATE | GATE CS Mock 2018 | Set 2 | Question 22

21. GATE | GATE CS Mock 2018 | Set 2 | Question 1

22. GATE | GATE CS Mock 2018 | Set 2 | Question 2

23. GATE | GATE CS Mock 2018 | Set 2 | Question 3

24. GATE | GATE CS Mock 2018 | Set 2 | Question 4

25. GATE | GATE CS Mock 2018 | Set 2 | Question 5