Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
From MaRDI portal
Publication:3115697
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
(12)- Describing homing and distinguishing sequences for nondeterministic finite state machines via synchronizing automata
- Lower bounds for synchronizing word lengths in partial automata
- Synchronization of automata with one undefined or ambiguous transition
- Synchronizing automata of bounded rank
- Careful synchronization of partial automata with restricted alphabets
- Extremal Binary PFAs with Small Number of States
- scientific article; zbMATH DE number 6606363 (Why is no real title available?)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Careful synchronization of partial deterministic finite automata
- A lower bound for the length of the shortest carefully synchronizing words
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
- Improved upper bounds on synchronizing nondeterministic 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)
