Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. A quadratic upper bound on the size of a synchronizing word in one-cluster automata;Béal;Int. J. Found. Comput. Sci.,2011
2. On the probability of being synchronizable;Berlinkov,2016
3. Synchronizing random almost-group automata;Berlinkov,2018
4. Circulants and their connectivities;Boesch;J. Graph Theory,1984