A lower bound for the length of the shortest carefully synchronizing words
From MaRDI portal
Publication:845082
DOI10.3103/S1066369X10010056zbMath1184.68321OpenAlexW2054252811MaRDI QIDQ845082
Publication date: 5 February 2010
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x10010056
Related Items
Using SAT solvers for synchronization issues in non-deterministic automata, Synchronization of Automata with One Undefined or Ambiguous Transition, Some results concerning careful synchronization of partial automata and subset synchronization of DFA's, Careful synchronization of partial deterministic finite automata, Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata, On the smallest synchronizing terms of finite tree automata, Lower Bounds for Synchronizing Word Lengths in Partial Automata, Preset Distinguishing Sequences and Diameter of Transformation Semigroups, Subset Synchronization and Careful Synchronization of Binary Finite Automata, Primitive Sets of Nonnegative Matrices and Synchronizing Automata
Cites Work