Pages that link to "Item:Q1008633"
From MaRDI portal
The following pages link to Synchronizing finite automata with short reset words (Q1008633):
Displayed 7 items.
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- Complexity of road coloring with prescribed reset words (Q2424693) (← links)
- COMPAS - A Computing Package for Synchronization (Q3073624) (← links)
- Genetic Algorithm for Synchronization (Q3618622) (← links)