Reset Complexity and Completely Reachable Automata with Simple Idempotents - Hoffmann, Stefan (Descriptional Complexity of Formal Systems, 2022)
Keywords: automata with simple idempotents; completely reachable automata; finite automata; set of synchronizing words; sync-maximal automata; synchronization