On maximal codes with bounded synchronization delay

DOI10.1016/S0304-3975(98)00028-0zbMath0913.68160OpenAlexW1992676512WikidataQ127957444 ScholiaQ127957444MaRDI QIDQ1275457

Véronique Bruyère

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00028-0

zbMATH Keywords

finite automatavariable-length codescombinatorics on words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (8)

Unnamed Item ⋮ Maximal circular codesversusmaximal codes ⋮ On maximal synchronous codes. ⋮ Completing circular codes in regular submonoids ⋮ Embeddings of local automata ⋮ FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS ⋮ On maximal codes with a finite interpreting delay. ⋮ Locally complete sets and finite decomposable codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completion of recognizable bifix codes
• On completion of codes with finite deciphering delay
• Completing biprefix codes
• On some properties of very pure codes
• On codes having no finite completions
• A combinatorial property of codes having finite synchronization delay
• Precircular codes and periodic biinfinite words
• Codes générateurs minimaux de langages de mots bi-infinis
• The method of poles: a coding method for constrained channels
• Each regular code is included in a maximal regular code
• A General Method for Channel Coding
• Algorithms for sliding block codes - An application of symbolic dynamics to information theory
• Surjective Extensions of Sliding-Block Codes
• On a Factorisation of Free Monoids

This page was built for publication: On maximal codes with bounded synchronization delay