The following pages link to (Q5150411):
Displayed 3 items.
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- A complete solution to the complexity of synchronizing road coloring for non-binary alphabets (Q2346422) (← links)