Computer Sciences > GATE 2021 SET-2 > Automata
Consider the following deterministic finite automaton (DFA).
The number of strings of length 8 accepted by the above automaton is _______.
Correct : 256 to 256
Similar Questions
Suppose we want to design a synchronous circuit that processes a string of 0's and 1's. Given a string, it produces another string by replacing the firs...
Suppose we want to design a synchronous circuit that processes a string of 0's and 1's. Given a string, it produces another string by replacing the firs...
Suppose we want to design a synchronous circuit that processes a string of 0's and 1's. Given a string, it produces another string by replacing the firs...
Total Unique Visitors
Loading......