The language consists of binary strings ending in ten. Track three suffix conditions: no useful partial match, last symbol one, and last two symbols ten (accepting). These states are distinguishable by suitable suffixes and suffice for every transition. The minimal DFA therefore has three states.
More Regular Expressions and Finite Automata questions
GATE 2015 CS (CS2) Q60– Over 0,1, λ denotes the empty string. A regular grammar satisfies X0=1X1, X1=0X1+1X2,…
GATE 2015 CS (CS3) Q32– Over Σ=0,1, let L be represented by Σ*0011Σ*. Find the minimum DFA-state count for its…
GATE 2021 CS (CS2) Q19– Regular L⊆0,1* has a minimal DFA with k states. Which language necessarily also has a…
GATE 2021 CS (CS2) Q27– For the DFA shown, how many binary strings of length eight are accepted?
GATE 2021 CS (CS2) Q57– Which regular expressions denote the binary numbers divisible by three? Leading zeros are…
GATE 2026 CS (CS1) Q26– Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet.…