We prove that, unless P = NP, no polynomial-time algorithm can approximate the minimum length of synchronizing words for a given synchronizing automaton within a constant factor. © 2010 Springer-Verlag.The author acknowledges support from the Federal Education Agency of Russia, grant 2.1.1/3537, and from the Russian Foundation for Basic Research, grant 09-01-12142
We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nest...
We approach the task of computing a carefully synchronizing word of minimum length for a given parti...
We present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortes...
We prove that, unless P=NP, no polynomial-time algorithm can approximate the minimum length of reset...
A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors i...
AbstractA synchronizing word for a given synchronizing DFA is called minimal if none of its proper f...
AbstractWe give a polynomial upper bound for the length of the shortest word of minimal rank in a tr...
It was conjectured by Černý in 1964, that a synchronizing DFA on nn states always has a synchronizin...
A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors i...
An automaton is synchronizing if there is a word that maps all states onto the same state. \v{C}ern\...
This work is motivated by the ˇCern´y Conjecture – an old unsolved problem in the automata theory. W...
Contains fulltext : 173189.pdf (preprint version ) (Open Access) ...
A synchronizing word of a deterministic finite complete automaton is a word whose action maps every ...
It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synch...
Contains fulltext : 176563.pdf (publisher's version ) (Closed access) ...
We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nest...
We approach the task of computing a carefully synchronizing word of minimum length for a given parti...
We present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortes...
We prove that, unless P=NP, no polynomial-time algorithm can approximate the minimum length of reset...
A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors i...
AbstractA synchronizing word for a given synchronizing DFA is called minimal if none of its proper f...
AbstractWe give a polynomial upper bound for the length of the shortest word of minimal rank in a tr...
It was conjectured by Černý in 1964, that a synchronizing DFA on nn states always has a synchronizin...
A synchronizing word for a given synchronizing DFA is called minimal if none of its proper factors i...
An automaton is synchronizing if there is a word that maps all states onto the same state. \v{C}ern\...
This work is motivated by the ˇCern´y Conjecture – an old unsolved problem in the automata theory. W...
Contains fulltext : 173189.pdf (preprint version ) (Open Access) ...
A synchronizing word of a deterministic finite complete automaton is a word whose action maps every ...
It was conjectured by Černý in 1964 that a synchronizing DFA on n states always has a shortest synch...
Contains fulltext : 176563.pdf (publisher's version ) (Closed access) ...
We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nest...
We approach the task of computing a carefully synchronizing word of minimum length for a given parti...
We present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortes...