Let M be a Finite State Machine shown below. ν(s0,x) denotes the state reached from the start state s0 after reading input string x, and ∥x∥ denotes the length of x.
(10%) How many distinct input strings x are there such that ∥x∥=12 and ν(s0,x)=s0?
