Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata

Authors:
Pavel Martyugin
Affiliations:
Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia 620000
Venue:
Theory of Computing Systems
Year:
2014

Citing 11
Cited 0

Reset sequences for monotonic automata

SIAM Journal on Computing
Directable nondeterministic automata

Acta Cybernetica
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
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
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
Synchronization of automata with one undefined or ambiguous transition

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the problem of checking careful synchronizability of partial finite automata is PSPACE-complete. Also the problems of checking D1-, D2-, and D3-directability of nondeterministic finite automata are PSPACE-complete; moreover, the restrictions of all these problems to automata with two input letters remain PSPACE-complete.