scientific article; zbMATH DE number 6606363

MaRDI QIDQ5740433zbMATH OpenFDO

Authors

Publication date 26 July 2016

zbMATH Keywords

shortest synchronizing wordsynchronizing automataČerný conjecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• A lower bound for the length of the shortest carefully synchronizing words
• Computing the shortest reset words of synchronizing automata
• Modifying the upper bound on the length of minimal synchronizing word
• Lower bounds for synchronizing word lengths in partial automata
• Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
• Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata
• Finding DFAs with maximal shortest synchronizing word length
• Subword complexity and k-synchronization

Cited in

(4)

• 2-Synchronizing Words
• Genetic Algorithm for Synchronization
• scientific article; zbMATH DE number 2051185 (Why is no real title available?)
• Finding short synchronizing words for prefix codes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740433)