AbstractČerný's conjecture and the road coloring problem are two open problems concerning synchronization of finite automata. We prove these conjectures in the special case that the vertices have uniform in- and outdegrees
We present several infinite series of synchronizing automatafor which the minimum length of reset wo...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
We prove that a random automaton with n states and any fixed non-singleton alphabet is synchronizing...
AbstractČerný's conjecture and the road coloring problem are two open problems concerning synchroniz...
We deal with k-out-regular directed multigraphs with loops (called simply digraphs). The edges of su...
An automaton is synchronizing if there exists a word that sends all states of the automaton to a sin...
Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton...
Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deter...
AbstractA coloring of edges of a finite directed graph turns the graph into a finite-state automaton...
We deal with k-out-regular directed multigraphs with loops (called simply digraphs). The edges of su...
Abstract. An independent system of words for a finite automaton is a set of k words taking any state...
In this thesis we study Trahtman's proof of Road coloring problem and related algorithm. For every s...
AbstractThe synchronization problem is investigated for the class of locally strongly transitive aut...
AbstractWe prove the Černý conjecture for one-cluster automata with prime length cycle. Consequences...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
We present several infinite series of synchronizing automatafor which the minimum length of reset wo...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
We prove that a random automaton with n states and any fixed non-singleton alphabet is synchronizing...
AbstractČerný's conjecture and the road coloring problem are two open problems concerning synchroniz...
We deal with k-out-regular directed multigraphs with loops (called simply digraphs). The edges of su...
An automaton is synchronizing if there exists a word that sends all states of the automaton to a sin...
Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton...
Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deter...
AbstractA coloring of edges of a finite directed graph turns the graph into a finite-state automaton...
We deal with k-out-regular directed multigraphs with loops (called simply digraphs). The edges of su...
Abstract. An independent system of words for a finite automaton is a set of k words taking any state...
In this thesis we study Trahtman's proof of Road coloring problem and related algorithm. For every s...
AbstractThe synchronization problem is investigated for the class of locally strongly transitive aut...
AbstractWe prove the Černý conjecture for one-cluster automata with prime length cycle. Consequences...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
We present several infinite series of synchronizing automatafor which the minimum length of reset wo...
We present several series of synchronizing automata with multiple parameters, generalizing previousl...
We prove that a random automaton with n states and any fixed non-singleton alphabet is synchronizing...
DOI
Add to ORKG