Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference50 articles.
1. Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words;Hoffmann,2021
2. Sync-maximal permutation groups equal primitive permutation groups;Hoffmann,2021
3. Homing and synchronizing sequences;Sandberg,2004
4. Černý's conjecture and the road colouring problem;Kari,2021
5. Estimation of the length of reset words for automata with simple idempotents;Rystsov;Cybern. Syst. Anal.,2000
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献