Completion of recognizable bifix codes
From MaRDI portal
Publication:673111
DOI10.1016/0304-3975(94)00300-8zbMath0873.68031OpenAlexW1968850105MaRDI QIDQ673111
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00300-8
Related Items (15)
A completion algorithm for codes with bounded synchronization delay ⋮ Unnamed Item ⋮ On the maximality of languages with combined types of code properties ⋮ When variable-length codes meet the field of error detection ⋮ Completing comma-free codes ⋮ Topologies for error-detecting variable-length codes ⋮ Completion of codes with finite bi-decoding delays. ⋮ An application of Hajós factorizations to variable-length codes ⋮ Completing circular codes in regular submonoids ⋮ Finite maximal solid codes ⋮ Generalizations of Code Languages with Marginal Errors ⋮ On maximal codes with bounded synchronization delay ⋮ Maximal bifix codes ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ On maximal codes with a finite interpreting delay.
Cites Work
This page was built for publication: Completion of recognizable bifix codes
