Consider the following deterministic finite automation (DFA).
The number of strings of length 8 accepted by the above automation is _________.

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

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