Consider the following deterministic finite automaton (DFA) The number of…

GATE · 2021 · CS · Set 2 · Computer Science & IT

Consider the following deterministic finite automaton (DFA)

The number of strings of length 8 accepted by the above automaton is ___________.

Attempted by 274 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…