Synchronization

DOI10.1016/j.ic.2008.03.005zbMath1160.68021WikidataQ56767142 ScholiaQ56767142MaRDI QIDQ948067

Helmut Jürgensen

Publication date: 8 October 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.005

zbMATH Keywords

automata; synchronization; codes; Černý's conjecture; solid codes

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Algebraic synchronization criterion and computing reset words, Computing the shortest reset words of synchronizing automata, A quadratic algorithm for road coloring, Genetic Algorithm for Synchronization

Cites Work

• Decoders with initial state invariance for multivalued encodings
• Solid codes and disjunctive domains
• An algebra of discrete channels that involve combinations of three basic error types
• Sticky-free and overhang-free DNA languages
• The Mathematical Foundation of Informatics
• Notable trends concerning the synchronization of graphs and automata
• Reset Sequences for Monotonic Automata
• Synchronizing Automata Preserving a Chain of Partial Orders
• SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
• Error correction for channels with substitutions, insertions, and deletions
• Structural analysis of error-correcting codes for discrete channels that involve combinations of three basic error types
• Near-optimal, single-synchronization-error-correcting code
• On the capabilities of codes to correct synchronization errors
• Finite maximal solid codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item