The first two input bits move through the first two layers, in either case reaching the third layer. The third bit reaches the accepting state, whose loop accepts either symbol thereafter. Thus every binary word of length at least three is accepted. There are 2⁸=256 words of length eight.
More Regular Expressions and Finite Automata questions
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.…
GATE 2026 CS (CS1) Q51– Let L 1 and L 2 be two languages over a finite alphabet, such that L 1 L 2 and L 2 are…
GATE 2026 CS (CS2) Q47– Consider the following two finite automata D 1 and D 2. Which of the following statements…
GATE 2025 CS (CS1) Q28– A regular language L is accepted by a non-deterministic finite automaton (NFA) with n…
GATE 2025 CS (CS1) Q50– Consider the following deterministic finite automaton (DFA) defined over the alphabet, =…
