Careful synchronization of partial automata with restricted alphabets
From MaRDI portal
Publication:4928474
DOI10.1007/978-3-642-38536-0_7zbMATH Open1381.68129OpenAlexW120468736MaRDI QIDQ4928474FDOQ4928474
Authors: Pavel Martyugin 
Publication date: 14 June 2013
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_7
Recommendations
- A lower bound for the length of the shortest carefully synchronizing words
- Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
- Subset synchronization and careful synchronization of binary finite automata
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
- Synchronization of automata with one undefined or ambiguous transition
Cited In (15)
- 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
- Lower bounds for synchronizing word lengths in partial automata
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
- Subset synchronization in monotonic automata
- The relation between preset distinguishing sequences and synchronizing sequences
- Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
- Synchronizing Automata Preserving a Chain of Partial Orders
- Slowly synchronizing automata with fixed alphabet size
- Subset synchronization and careful synchronization of binary finite automata
- Careful synchronization of partial deterministic finite automata
- On the smallest synchronizing terms of finite tree automata
- Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
- Synchronization of automata with one undefined or ambiguous transition
This page was built for publication: Careful synchronization of partial automata with restricted alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928474)
