GATE 2007
October 3, 2023GATE 2023
October 3, 2023DFA
|
Question 3
|
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet {a,b}, such that no string has 3 consecutive occurrences of the letter b.
|
Theory Explanation.
|
Correct Answer: A