A lower bound for the length of the shortest carefully synchronizing words

Abstract

We introduce the notion of careful synchronization for partial finite automata as a natural generalization of the synchronization notion for complete finite automata. We obtain a lower bound for the careful synchronization threshold for automata with a given number of states.