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
Which of the following is/are undecidable?
Consider the 5-state DFA M accepting the language L(M) ⊂ (0 + 1)* shown below. For any string w ∈ (0 + 1)* let n0(w) be the number of 0′s in w and n1(w) be the...
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
Total Unique Visitors
Loading......