AbstractWe give a polynomial upper bound for the length of the shortest word of minimal rank in a transitive n-state unambiguous automation whose transition monoid does not contain the null relation. In particular, in an n-state synchronizing unambiguous automation there is a synchronizing word of length less than 12n3
We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nest...
A synchronizing word of a deterministic finite complete automaton is a word whose action maps every ...
International audienceČerný's conjecture asserts the existence of a synchronizing word of length at ...
AbstractWe give a polynomial upper bound for the length of the shortest word of minimal rank in a tr...
AbstractA synchronizing word for a given synchronizing DFA is called minimal if none of its proper f...
A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors i...
A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors i...
We prove that, unless P=NP, no polynomial-time algorithm can approximate the minimum length of reset...
An automaton is synchronizing if there is a word that maps all states onto the same state. \v{C}ern\...
We prove that, unless P = NP, no polynomial-time algorithm can approximate the minimum length of syn...
This work is motivated by the ˇCern´y Conjecture – an old unsolved problem in the automata theory. W...
AbstractWe present a new class of automata which strictly contains the class of aperiodic automata a...
International audienceWe study mortal words and words of minimum non-zero rank (in particular, synch...
International audienceLet A be a finite automaton. We are concerned with the minimal length of the w...
AbstractIn an earlier paper, we have studied reset words for synchronizing automatawhose states admi...
We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nest...
A synchronizing word of a deterministic finite complete automaton is a word whose action maps every ...
International audienceČerný's conjecture asserts the existence of a synchronizing word of length at ...
AbstractWe give a polynomial upper bound for the length of the shortest word of minimal rank in a tr...
AbstractA synchronizing word for a given synchronizing DFA is called minimal if none of its proper f...
A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors i...
A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors i...
We prove that, unless P=NP, no polynomial-time algorithm can approximate the minimum length of reset...
An automaton is synchronizing if there is a word that maps all states onto the same state. \v{C}ern\...
We prove that, unless P = NP, no polynomial-time algorithm can approximate the minimum length of syn...
This work is motivated by the ˇCern´y Conjecture – an old unsolved problem in the automata theory. W...
AbstractWe present a new class of automata which strictly contains the class of aperiodic automata a...
International audienceWe study mortal words and words of minimum non-zero rank (in particular, synch...
International audienceLet A be a finite automaton. We are concerned with the minimal length of the w...
AbstractIn an earlier paper, we have studied reset words for synchronizing automatawhose states admi...
We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nest...
A synchronizing word of a deterministic finite complete automaton is a word whose action maps every ...
International audienceČerný's conjecture asserts the existence of a synchronizing word of length at ...
DOI
Add to ORKG