Number of strings accepted by Finite Automata




It should be 20.

(6!//3!3!) = 20

It’s like you have a string “abcxyz” & the question asks you to find out all possible permutations of the letters in which the relative ordering is always maintained, i.e. a is followed by b, b is followed by c, x is followed by y and y is followed by z.

= total permutations/restricted permutations

= 6!/3!3!