Synchronizing Finite Automata with Short Reset Words

摘要

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. This work is supported by the State Committee for Scientific Research - Grant No. 3 T11C 010 27.