Question: Draw a finite state machine that takes arbitrary length strings of letters as input and prints a 1 if the string contains the letter S
Draw a finite state machine that takes arbitrary length strings of letters as input and prints a 1 if the string contains the letter S exactly three times. Assume the alphabet is limited and only the letters S and C can be used as input letters.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
