Apr 1, 2021 · High-quality heuristics such as SynchroP producing relatively shorter sequences are very expensive and can take hours when the automaton has tens of thousands ...

The SynchroP heuristic has been frequently used as a benchmark to evaluate the performance of the new heuristics. In this work, we first improve the runtime of ...

This work redesigns the previously fastest known exact algorithm based on the bidirectional breadth-first search and improves it with respect to time and ...

For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important.

The SynchroP heuristic has been frequently used as a benchmark to evaluate the performance of the new heuristics. In this work, we first improve the runtime of ...

Nov 17, 2020 · For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important.

Boosting expensive synchronizing heuristics N.E. Sarac, Ö.F. Altun, K.T. Atam, S. Karahoda, K. Kaya, H. Yenigün, Expert Systems with Applications 167 (2021) ...

Greedy and Cycle are the fastest synchronizing heuristics currently known. In this paper, without sacrificing the quality of the synchronizing words, we improve ...

Greedy and Cycle are the fastest synchronizing heuristics currently known. In this paper, without sacrificing the quality of the synchronizing words, we improve ...

Algorithmic optimization and parallelization of eppstein's synchronizing heuristic · Boosting expensive synchronizing heuristics · Using Sat solvers for ...