Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
From MaRDI portal
Publication:3115697
zbMATH Open1249.68103MaRDI QIDQ3115697FDOQ3115697
Authors: Pavel Martyugin 
Publication date: 10 February 2012
Recommendations
- A lower bound for the length of the shortest carefully synchronizing words
- Careful synchronization of partial automata with restricted alphabets
- Lower bounds for synchronizing word lengths in partial automata
- Subset synchronization and careful synchronization of binary finite automata
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
Cited In (11)
- Extremal Binary PFAs with Small Number of States
- Title not available (Why is that?)
- A lower bound for the length of the shortest carefully synchronizing words
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Improved upper bounds on synchronizing nondeterministic automata
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata
- Synchronizing Automata of Bounded Rank
- Careful synchronization of partial deterministic finite automata
- Synchronization of Automata with One Undefined or Ambiguous Transition
- Lower Bounds for Synchronizing Word Lengths in Partial Automata
This page was built for publication: Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115697)
