Careful synchronization of partial automata with restricted alphabets

DOI10.1007/978-3-642-38536-0_7MaRDI QIDQ4928474zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

careful synchronizationpartial automatasynchronizing wordsČerný conjecture

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
• 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

(17)

• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
• Slowly synchronizing automata with fixed alphabet size
• Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
• Careful synchronization of partial deterministic finite automata
• Subset synchronization and careful synchronization of binary finite automata
• Synchronization of automata with one undefined or ambiguous transition
• 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
• Subset synchronization in monotonic automata
• scientific article; zbMATH DE number 7152087 (Why is no real title available?)
• Lower bounds for synchronizing word lengths in partial automata
• Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
• On the smallest synchronizing terms of finite tree automata
• On the smallest synchronizing terms of finite tree automata
• Careful synchronization of one-cluster automata
• The relation between preset distinguishing sequences and synchronizing sequences
• A lower bound for the length of the shortest carefully synchronizing words

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)