Draw the state transition of a deterministic finite state automaton which…

PYQ GATE 1993

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.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…