Synchronization of Automata with One Undefined or Ambiguous Transition
Author:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 278-288
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- 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
- Lower bounds for natural proof systems1977