The following pages link to Unambiguous automata (Q942992):
Displaying 6 items.
- Strongly transitive automata and the Černý conjecture (Q1038421) (← links)
- Codes and noncommutative stochastic matrices (Q1959746) (← links)
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems (Q2348373) (← links)
- Modifying the Upper Bound on the Length of Minimal Synchronizing Word (Q3088281) (← links)
- The Synchronization Problem for Strongly Transitive Automata (Q3533015) (← links)
- On the length of uncompletable words in unambiguous automata (Q5108371) (← links)
