Synchronizing Automata: Open Problems
Marek Szykuła
Abstract
We survey selected open problems in the theory of synchronizing automata, centered around the famous Černý conjecture. A deterministic finite automaton is called synchronizing if it admits a reset word whose action maps all states to a single state. The Černý conjecture states that every synchronizing automaton with n states possesses a reset word of length at most (n-1)2. We discuss avoiding words, compressing a state with another, synchronization of a (given or any) subset, complexity of deciding the synchronizability, average reset threshold, and linear-algebraic methods. Some new auxiliary results are also presented.
Create a lesson
Related papers
Context-Free Fixed Points and Complete Classification of Orbits in Picard Iteration for Guarded Power Language Operators
Atanas Ilchev, Hristo Kiskinov, George Pashev et al.
Mining DTA with SMT by Exploiting Simple Elementary Language and Timed Augmented Prefix Acceptor
Ziran Wang, Jie An, Naijun Zhan
Compressed Subsequence Checking is PSPACE-complete
Markus Lohrey
Non-Terminal Complexity of Simple Semi-Conditional Grammars
Henning Fernau, Sanjay Jain, Linus Richter et al.
On the Kanazawa--Salvati Conjecture
Takao Yuyama
Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound
Kehinde Adeogun, Christos A. Kapoutsis