Reset sequences for monotonic automata
SIAM Journal on Computing
Composition sequences for functions over a finite domain
Theoretical Computer Science
Synchronizing finite automata on Eulerian digraphs
Theoretical Computer Science - Mathematical foundations of computer science
Synchronizing generalized monotonic automata
Theoretical Computer Science - Insightful theory
The mortality threshold for partially monotonic automata
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On a conjecture by Carpi and D'Alessandro
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Slowly synchronizing automata and digraphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Complexity of problems concerning reset words for cyclic and Eulerian automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Lower bounds for the length of reset words in Eulerian automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Complexity of problems concerning reset words for cyclic and Eulerian automata
Theoretical Computer Science
Synchronizing automata of bounded rank
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
We present a new class of automata which strictly contains the class of aperiodic automata and shares with the latter certain synchronization properties. In particular, every strongly connected automaton in this new class is synchronizing and has a synchronizing word of length @?n(n+1)6@? where n is the number of states of the automaton.