We reduce the problem of synchronization of an n-state automaton with letters of rank at most r < n to the problem of synchronization of an r-state automaton with constraints given by a regular language. Using this technique we construct a series of synchronizing n-state automata in which every letter has rank r < n and whose reset threshold is at least r 2-r-1 Moreover, if r > n/2, such automata are strongly connected. © 2012 Springer-Verlag.
CITATION STYLE
Gusev, V. V. (2012). Synchronizing automata of bounded rank. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7381 LNCS, pp. 171–179). https://doi.org/10.1007/978-3-642-31606-7_15
Mendeley helps you to discover research relevant for your work.