the Game of Flips With Three Coins as Finite State Automaton (FSA)

There are different types of theoretical machines that are mathematical models for actual process . By considering the possible inputs on which these machine can work ,we can analyze their strengths, Finite State Automata(FSA) is one of these type of machine .The aim of this paper is to represent the Game of flips (Which played with three coins) as Finite State Automaton, then finding all winning sequence The shortest word in accepting language is the shortest solution of this puzzle .