Synchronizability of products of at least three cornered DFAs
Let , let be an alphabet, and let satisfy . For DFAs over , suppose that each has an -corner . Their direct product is
A word is -synchronizing if it maps every product state to .
Product-corner conjecture. If are distinct and each contains an -corner , then is -synchronizable. The conjecture extends the paper's product results from two factors to at least three factors. The source supplies no resolution, so it remains open.
References
- Peter Bradshaw, Alexander Clow and Ladislav Stacho, “A cornering strategy for synchronizing a DFA”, arXiv:2405.00826 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.