Question

John is asked to make an automaton which accepts a given string for all the occurrence of '1001' in it. How many number of transitions would John use such that, the string
processine application works?
a) 9
b) 11
c) 12
d) 15​

Answer 1

Answer:

c is the correct one please mark me as brainlist if you like my answer and then follow me and thanks all my answers plzzzzzzz me

Answer 2

Answer:

option C is your correct answer

Explanation:

plz follow me and Mark as brain list