AbstractThe synchronization problem is investigated for the class of locally strongly transitive automata introduced in Carpi and DʼAlessandro (2009) [9]. Some extensions of this problem related to the notions of stable set and word of minimal rank of an automaton are studied. An application to synchronizing colorings of aperiodic graphs with a Hamiltonian path is also considered
In this thesis we study Trahtman's proof of Road coloring problem and related algorithm. For every s...
We approach the problem of finding strongly connected synchronizing automata with a given ideal I th...
We follow language theoretic approach to synchronizing automata and Cerny's conjecture initiated in ...
The synchronization problem is investigated for the class of locally strongly transitive automata in...
AbstractThe synchronization problem is investigated for the class of locally strongly transitive aut...
Abstract. An independent system of words for a finite automaton is a set of k words taking any state...
The synchronization problem is investigated for a new class of deterministic automata called locally...
This paper mainly concerns the property of strong local transitivity of finite automata. We will sur...
Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deter...
AbstractWe present a new class of automata which strictly contains the class of aperiodic automata a...
International audienceWe study the computational complexity of various problems related to synchroni...
The Hybrid Cerny-Road coloring problem is investigated for graphs with Hamiltonian paths. We prove t...
International audienceWe study extremal and algorithmic questions of subset and careful synchronizat...
The thesis is an introduction to the research of sychronizing words of finite automata and the Černý...
We consider the following generalized notion of synchronization: A word is called a reset word of a ...
In this thesis we study Trahtman's proof of Road coloring problem and related algorithm. For every s...
We approach the problem of finding strongly connected synchronizing automata with a given ideal I th...
We follow language theoretic approach to synchronizing automata and Cerny's conjecture initiated in ...
The synchronization problem is investigated for the class of locally strongly transitive automata in...
AbstractThe synchronization problem is investigated for the class of locally strongly transitive aut...
Abstract. An independent system of words for a finite automaton is a set of k words taking any state...
The synchronization problem is investigated for a new class of deterministic automata called locally...
This paper mainly concerns the property of strong local transitivity of finite automata. We will sur...
Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deter...
AbstractWe present a new class of automata which strictly contains the class of aperiodic automata a...
International audienceWe study the computational complexity of various problems related to synchroni...
The Hybrid Cerny-Road coloring problem is investigated for graphs with Hamiltonian paths. We prove t...
International audienceWe study extremal and algorithmic questions of subset and careful synchronizat...
The thesis is an introduction to the research of sychronizing words of finite automata and the Černý...
We consider the following generalized notion of synchronization: A word is called a reset word of a ...
In this thesis we study Trahtman's proof of Road coloring problem and related algorithm. For every s...
We approach the problem of finding strongly connected synchronizing automata with a given ideal I th...
We follow language theoretic approach to synchronizing automata and Cerny's conjecture initiated in ...
DOI
Add to ORKG