GATE | Gate IT 2008 | Question 34

Consider the following two finite automata. M₁ accepts L₁ and M₂ accepts L₂.

Which one of the following is TRUE?
(A) L₁ = L₂
(B) L₁ ⊂ L₂
(C) L₁ ∩ L₂‘ = ∅
(D) L₁ ∪ L₂ ≠ L₁

Answer: (A)
Explanation:
Quiz of this Question

Article Tags :

GATE

GATE-Gate IT 2008

Recommended Articles

1. GATE | GATE CS 2008 | Question 1

2. GATE | GATE CS 2008 | Question 4

3. GATE | GATE CS 2008 | Question 85

4. GATE | GATE CS 2008 | Question 85

5. GATE | GATE CS 2008 | Question 8

6. GATE | GATE CS 2008 | Question 9

7. GATE | GATE CS 2008 | Question 10

8. GATE | GATE CS 2008 | Question 85

9. GATE | GATE CS 2008 | Question 12

10. GATE | GATE CS 2008 | Question 85

11. GATE | GATE CS 2008 | Question 16

12. GATE | GATE CS 2008 | Question 17

13. GATE | GATE CS 2008 | Question 85

14. GATE | GATE CS 2008 | Question 85

15. GATE | GATE CS 2008 | Question 20

16. GATE | GATE CS 2008 | Question 85

17. GATE | GATE CS 2008 | Question 23

18. GATE | GATE CS 2008 | Question 24

19. GATE | GATE CS 2008 | Question 25

20. GATE | GATE CS 2008 | Question 26

21. GATE | GATE CS 2008 | Question 27

22. GATE | GATE CS 2008 | Question 28

23. GATE | GATE CS 2008 | Question 29

24. GATE | GATE CS 2008 | Question 30

25. GATE | GATE CS 2008 | Question 31