Pages that link to "Item:Q1116340"
From MaRDI portal
The following pages link to On synchronizing unambiguous automata (Q1116340):
Displaying 9 items.
- On incomplete and synchronizing finite sets (Q517035) (← links)
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- Ranks of binary relations (Q1357114) (← links)
- The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
- The Synchronization Problem for Strongly Transitive Automata (Q3533015) (← links)
- On Nonnegative Integer Matrices and Short Killing Words (Q4992844) (← links)
- On finite monoids over nonnegative integer matrices and short killing words (Q5090493) (← links)
- On the length of uncompletable words in unambiguous automata (Q5108371) (← links)
- On codes with a finite deciphering delay: Constructing uncompletable words (Q5941067) (← links)