A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Subset Synchronization and Careful Synchronization of Binary Finite Automata
2016
International Journal of Foundations of Computer Science
We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial automata. In the later form, the result finishes the research initiated by Martyugin (2013) . Moreover, we show that both the thresholds remain strongly exponential even if restricted to strongly connected binary automata. In addition, we apply our methods to computational complexity. Existence
doi:10.1142/s0129054116500167
fatcat:6vsnh7chtrenviw72e4x5nxhxq