Pages that link to "Item:Q3533015"
From MaRDI portal
The following pages link to The Synchronization Problem for Strongly Transitive Automata (Q3533015):
Displaying 14 items.
- On incomplete and synchronizing finite sets (Q517035) (← links)
- The Černý conjecture for one-cluster automata with prime length cycle (Q719288) (← links)
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- On synchronizing unambiguous automata (Q1116340) (← links)
- An algorithm for road coloring (Q1932365) (← links)
- A tight linear bound on the synchronization delay of bijective automata (Q2373732) (← links)
- On a conjecture by Carpi and D'Alessandro (Q2909095) (← links)
- A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM (Q3021964) (← links)
- The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (Q3637215) (← links)
- (Q3696525) (← links)
- Trim Strongly Connected Synchronizing Automata and Ideal Languages (Q4686535) (← links)
- (Q5507064) (← links)
- Semisimple synchronizing automata and the Wedderburn-Artin theory (Q5890812) (← links)