Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA
From MaRDI portal
Publication:3569754
Recommendations
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- PSPACE-completeness of the problem of checking the careful synchronizability of a partial automaton
- Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
- Synchronization of automata with one undefined or ambiguous transition
- Complexity of checking whether two automata are synchronized by the same language
Cited in
(6)- On the computational complexity of problems related to distinguishability sets
- Synchronization of automata with one undefined or ambiguous transition
- The relation between preset distinguishing sequences and synchronizing sequences
- Complexity of checking whether two automata are synchronized by the same language
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- PSPACE-completeness of the problem of checking the careful synchronizability of a partial automaton
This page was built for publication: Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569754)