AbstractWe show that if the state set Q of a synchronizing automaton A=〈Q,Σ,δ〉 admits a linear order such that for each letter a∈Σ the transformation δ(_,a) of Q preserves this order, then A possesses a reset word of length |Q|-1. We also consider two natural generalizations of the notion of a reset word and provide for them results of a similar flavour
AbstractA reset word takes all states of a finite automaton to a single state. In this paper, it is ...
International audienceWe study extremal and algorithmic questions of subset and careful synchronizat...
We introduce the notion of reset left regular decomposition of an ideal regular language and we prov...
We show that if the state set Q of a synchronizing automaton A = (Q, ∑, δ) admits a linear order suc...
AbstractIn an earlier paper, we have studied reset words for synchronizing automatawhose states admi...
We consider the following generalized notion of synchronization: A word is called a reset word of a ...
In this study, we first introduce several problems related to finding reset words for deterministic ...
In this study, we first introduce several problems related to finding reset words for deterministic ...
We refine results about relations between Markov chains and synchronizing automata. We express the c...
An automaton is synchronizing if there exists a word that sends all states of the automaton to a sin...
We present a new class of automata which strictly contains the class of aperiodic automata and share...
We follow language theoretic approach to synchronizing automata and Černý’s conjecture initiated in ...
We show that if a semisimple synchronizing automaton with n states has a minimal reachable non-unary...
We approach the problem of finding strongly connected synchronizing automata with a given ideal I th...
AbstractA reset word takes all states of a finite automaton to a single state. In this paper, it is ...
International audienceWe study extremal and algorithmic questions of subset and careful synchronizat...
We introduce the notion of reset left regular decomposition of an ideal regular language and we prov...
We show that if the state set Q of a synchronizing automaton A = (Q, ∑, δ) admits a linear order suc...
AbstractIn an earlier paper, we have studied reset words for synchronizing automatawhose states admi...
We consider the following generalized notion of synchronization: A word is called a reset word of a ...
In this study, we first introduce several problems related to finding reset words for deterministic ...
In this study, we first introduce several problems related to finding reset words for deterministic ...
We refine results about relations between Markov chains and synchronizing automata. We express the c...
An automaton is synchronizing if there exists a word that sends all states of the automaton to a sin...
We present a new class of automata which strictly contains the class of aperiodic automata and share...
We follow language theoretic approach to synchronizing automata and Černý’s conjecture initiated in ...
We show that if a semisimple synchronizing automaton with n states has a minimal reachable non-unary...
We approach the problem of finding strongly connected synchronizing automata with a given ideal I th...
AbstractA reset word takes all states of a finite automaton to a single state. In this paper, it is ...
International audienceWe study extremal and algorithmic questions of subset and careful synchronizat...
We introduce the notion of reset left regular decomposition of an ideal regular language and we prov...
DOI
Add to ORKG