Reset sequences for monotonic automata
SIAM Journal on Computing
Directable nondeterministic automata
Acta Cybernetica
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On directable nondeterministic trapped automata
Acta Cybernetica
Algebraic Theory of Automata & Languages
Algebraic Theory of Automata & Languages
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
Improved upper bounds on synchronizing nondeterministic automata
Information Processing Letters
Modifying the upper bound on the length of minimal synchronizing word
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Approximating the Minimum Length of Synchronizing Words Is Hard
Theory of Computing Systems
| Hi-index | 0.00 |
We consider the careful synchronization of partial automata with only one undefined transition and the generalized synchronization of nondeterministic automata with only one ambiguous transition. For each of the two cases we prove that the problem of checking whether or not a given automaton is synchronizable is PSPACE-complete. The restrictions of these problems to 2-letter automata are also PSPACE-complete.