Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata
- 14 November 2013
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 54 (2) , 293-304
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Synchronization of Automata with One Undefined or Ambiguous Transition2012
- Modifying the Upper Bound on the Length of Minimal Synchronizing WordLecture Notes in Computer Science, 2011
- A lower bound for the length of the shortest carefully synchronizing wordsRussian Mathematics, 2010
- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA2010
- Improved upper bounds on synchronizing nondeterministic automataInformation Processing Letters, 2009
- Synchronizing Automata and the Černý Conjecture2008
- Algebraic Theory of Automata and Languages2004
- Some Results on Directable AutomataLecture Notes in Computer Science, 2004
- Reset Sequences for Monotonic AutomataSIAM Journal on Computing, 1990
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970