Sticker system model,as one of the important DNA computing model,simulates the sticking operation of DNA molecular.Here some basic definitions about sticker system model are presented with an example,and a discussion about its regular grammar characteristic is made briefly,then a finite automata model that is equivalent to the regular grammar model is put forward.