Reduces the lifting problem for the Černý conjecture to verifying the conjecture on radical, simple, and quasi-simple reset automata via a Galois connection between congruences and ideals of the transition monoid.
Synchronization of finite automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The hereditariness problem for the \v{C}ern\'y conjecture
Reduces the lifting problem for the Černý conjecture to verifying the conjecture on radical, simple, and quasi-simple reset automata via a Galois connection between congruences and ideals of the transition monoid.