The following pages link to (Q5150411):
Displaying 5 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)
- A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM (Q3021964) (← links)
- The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes (Q5195032) (← links)