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)

Correct : c,d

Similar Questions

Which of the following is/are undecidable?
#310 MSQ
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
#910 MCQ
Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted...
#1074 MCQ

Related Topics

deterministic finite automata DFA distinguishable states GATE CS 2024 Set-1 computer science gate state distinguishability language acceptance DFA counting zeros ones GATE 2024 Set-1 DFA language L(M)

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: