Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
From MaRDI portal
Publication:5448671
DOI10.1007/978-3-540-77566-9_39zbMATH Open1132.68461OpenAlexW1596878351MaRDI QIDQ5448671FDOQ5448671
Authors: Adam Roman, Wit Foryś 
Publication date: 7 March 2008
Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_39
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
- Lower bounds for synchronizing word lengths in partial automata
- Careful synchronization of partial automata with restricted alphabets
- Synchronizing automata preserving a chain of partial orders
Cites Work
Cited In (9)
- Synchronized components of a subshift
- Title not available (Why is that?)
- A lower bound for the length of the shortest carefully synchronizing words
- Dynamics of the independence number and automata synchronization
- 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 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
- Careful synchronization of partial automata with restricted alphabets
This page was built for publication: Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448671)
