The language consists of all nonempty binary strings. One initial nonaccepting state distinguishes the empty string; either first symbol moves to an accepting state that loops on both symbols. The two states cannot merge because their empty-suffix acceptance differs. Hence 2.
More Regular Expressions and Finite Automata questions
GATE 2016 CS (CS2) Q52– I: If every NFA state is accepting, the accepted language is Σ*. II: There exists a…
GATE 2017 CS (CS2) Q35– Find the minimum number of DFA states for L=\w 1aw 2:w 1,w 2\a,b\*,\ w 1 =2,\ w 2 3\.
GATE 2017 CS (CS2) Q49– An ε-NFA has start q₀. Transition triples (ε,a,b) are q₀:(q₂,q₁,q₀); q₁:(q₂,q₂,q₃);…
GATE 2012 CS (CS1) Q22– Over alphabet a, with ε the empty string, find the complement of the language accepted by…
GATE 2012 CS (CS1) Q35– L=ab,aa,baa. Which strings belong to L*? 1: abaabaaabaa; 2: aaaabaaaa; 3: baaaaabaaaab; 4:…
GATE 2012 CS (CS1) Q56– Over 0,1, every three-symbol substring must contain at most two zeros; all words shorter…