The language requires at least six symbols, with the third symbol fixed to a. Track prefixes of lengths 0,1,2; after a valid third symbol, track three more symbols until acceptance; add a dead state for b in position three. This gives seven progress/accepting states plus one dead state, eight total. Different remaining minimum lengths distinguish the progress states, proving minimality.
More Regular Expressions and Finite Automata questions
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…