Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata

DOI10.1007/978-3-540-77566-9_39MaRDI QIDQ5448671zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

• scientific article; zbMATH DE number 2040899 (Why is no real title available?)
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• scientific article; zbMATH DE number 3354928 (Why is no real title available?)
• Synchronization and stability of finite automata
• Theory Is Forever

Cited in

(9)

• Synchronized components of a subshift
• scientific article; zbMATH DE number 6606363 (Why is no real title available?)
• 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)