GATE CS 2021 (Afternoon) — Question 27

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)NAT1 markMedium

Consider the following deterministic finite automation (DFA).
Question image
The number of strings of length 8 accepted by the above automation is _________.
Practise the full 2021-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group