Synchronizing Automata

Synchronizing automata are connected to algebra and combinatorics, and they have applications in many areas including robotics, coding theory, network security management, chip design, industrial automation, biocomputing, etc. In this chapter, we consider synchronizing automata in the framework of Markovian text generation, with examples of application to pattern recognition in randomly generated sequences.