Draw a deterministic finite state machine for the input alphabet A where A = {1, 2, 3,

Fantastic news! We've Found the answer you've been seeking!

Question:

Draw a deterministic finite state machine for the input alphabet A where A = {1, 2, 3, 4, 5} that recognises exactly all strings that include the 2 letter string 42 exactly once. For example, the machine will accept the string 54214 but reject the strings 432 and 421421.