Using synchronizing heuristics to construct homing sequences

Çirişci, Berk and Emek, M. Yuşa and Sorguç, Ege and Kaya, Kamer and Yenigün, Hüsnü (2019) Using synchronizing heuristics to construct homing sequences. In: 7th International Conference on Model-Driven Engineering and Software Development (MODELSWARD 2019), Prague, Czech Republic

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.5220/0007403503640371


Computing a shortest synchronizing sequence of an automaton is an NP-Hard problem. There are well-known heuristics to find short synchronizing sequences. Finding a shortest homing sequence is also an NP-Hard problem. Unlike existing heuristics to find synchronizing sequences, homing heuristics are not widely studied. In this paper, we discover a relation between synchronizing and homing sequences by creating an automaton called homing automaton. By applying synchronizing heuristics on this automaton we get short homing sequences. Furthermore, we adapt some of the synchronizing heuristics to construct homing sequences.

Item Type:Papers in Conference Proceedings
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:37817
Deposited By:Hüsnü Yenigün
Deposited On:28 Aug 2019 10:12
Last Modified:28 Aug 2019 10:12

Repository Staff Only: item control page