Let S E = {A}". Let |S| Denote The Length Of String S. Construct A Finite Automaton In Less Than Two Three Dozen States That Recognizes The Language:

L = {S: Gcd(|S\, 504) >6},

Where Ged(X, Y) Denotes The Greatest Common Divisor Between Two Numbers X, Y.