Computer Sciences > GATE 2024 SET-1 > Automata
Consider the 5-state DFA M accepting the language L(M) ⊂ (0 + 1)* shown below. For any string w ∈ (0 + 1)* let n0(w) be the number of 0′s in w and n1(w) be the number of 1′s in w.
Which of the following statements is/are FALSE?
A
States 2 and 4 are distinguishable in M
B
States 3 and 4 are distinguishable in M
C
States 2 and 5 are distinguishable in M
D
Any string w with n0(w) = n1(w) is in L(M)

Explanation

Correct : c,d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science