@article{(Open Science Index):https://publications.waset.org/pdf/1803, title = {New Algorithms for Finding Short Reset Sequences in Synchronizing Automata}, author = {Adam Roman}, country = {}, institution = {}, abstract = {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. }, journal = {International Journal of Computer and Information Engineering}, volume = {1}, number = {7}, year = {2007}, pages = {2172 - 2176}, ee = {https://publications.waset.org/pdf/1803}, url = {https://publications.waset.org/vol/7}, bibsource = {https://publications.waset.org/}, issn = {eISSN: 1307-6892}, publisher = {World Academy of Science, Engineering and Technology}, index = {Open Science Index 7, 2007}, }