AbstractWe prove the Černý conjecture for one-cluster automata with prime length cycle. Consequences are given for the hybrid road coloring–Černý conjecture for strongly connected aperiodic digraphs with a proper cycle of prime length
Abstract. An independent system of words for a finite automaton is a set of k words taking any state...
AbstractA coloring of edges of a finite directed graph turns the graph into a finite-state automaton...
The thesis is an introduction to the research of sychronizing words of finite automata and the Černý...
AbstractWe prove the Černý conjecture for one-cluster automata with prime length cycle. Consequences...
We present a new class of automata which strictly contains the class of aperiodic automata and share...
AbstractČerný's conjecture and the road coloring problem are two open problems concerning synchroniz...
International audienceČerný’s conjecture asserts the existence of a synchronizing word of length at ...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
Černý's conjecture asserts the existence of a synchronizing word of length at most (n - 1)2 for any ...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
AbstractThe synchronization problem is investigated for the class of locally strongly transitive aut...
AbstractPin showed that every p-state automaton (p a prime) containing a cyclic permutation and a no...
Motivated by the Babai conjecture and the Černý conjecture, we study the reset thresholds of automat...
AbstractWe present a new class of automata which strictly contains the class of aperiodic automata a...
We present several infinite series of synchronizing automatafor which the minimum length of reset wo...
Abstract. An independent system of words for a finite automaton is a set of k words taking any state...
AbstractA coloring of edges of a finite directed graph turns the graph into a finite-state automaton...
The thesis is an introduction to the research of sychronizing words of finite automata and the Černý...
AbstractWe prove the Černý conjecture for one-cluster automata with prime length cycle. Consequences...
We present a new class of automata which strictly contains the class of aperiodic automata and share...
AbstractČerný's conjecture and the road coloring problem are two open problems concerning synchroniz...
International audienceČerný’s conjecture asserts the existence of a synchronizing word of length at ...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
Černý's conjecture asserts the existence of a synchronizing word of length at most (n - 1)2 for any ...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
AbstractThe synchronization problem is investigated for the class of locally strongly transitive aut...
AbstractPin showed that every p-state automaton (p a prime) containing a cyclic permutation and a no...
Motivated by the Babai conjecture and the Černý conjecture, we study the reset thresholds of automat...
AbstractWe present a new class of automata which strictly contains the class of aperiodic automata a...
We present several infinite series of synchronizing automatafor which the minimum length of reset wo...
Abstract. An independent system of words for a finite automaton is a set of k words taking any state...
AbstractA coloring of edges of a finite directed graph turns the graph into a finite-state automaton...
The thesis is an introduction to the research of sychronizing words of finite automata and the Černý...
DOI
Add to ORKG