Concept drill

Distinguishable States

GATE CSE & IT · Theory of Computation - Automata Theory - DFA · 2024-2024

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Source-book anchor pending for this concept.

Practice action

Start latest PYQ

PYQs in this concept

All concepts →

2024 Q50

Consider the 5-state DFA M accepting the language L(M) ⊂ (0+1)* shown below. For any string w ∈ (0+1)* let n₀(w) be the number of 0's in w and n₁(w) be the number of 1's in w. Whic...

hardanswer key