TY - JFULL AU - Adam Roman PY - 2007/8/ TI - New Algorithms for Finding Short Reset Sequences in Synchronizing Automata T2 - International Journal of Computer and Information Engineering SP - 2171 EP - 2176 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/1803 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 7, 2007 N2 - Finding synchronizing sequences for the finite automata is a very important problem in many practical applications (part orienters in industry, reset problem in biocomputing theory, network issues etc). Problem of finding the shortest synchronizing sequence is NP-hard, so polynomial algorithms probably can work only as heuristic ones. In this paper we propose two versions of polynomial algorithms which work better than well-known Eppstein-s Greedy and Cycle algorithms. ER -