Maximal bifix codes

DOI10.1016/S0304-3975(98)00253-9zbMath0916.68116OpenAlexW2008184600MaRDI QIDQ1292485

Véronique Bruyère, Dominique Perrin

Publication date: 21 June 1999

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

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

zbMATH Keywords

variable-length codescombinatorics on words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

On maximal synchronous codes. ⋮ Completion of codes with finite bi-decoding delays. ⋮ Completing circular codes in regular submonoids ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ On maximal codes with a finite interpreting delay.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completion of recognizable bifix codes
• Completing biprefix codes
• A property of biprefix codes

This page was built for publication: Maximal bifix codes