Completion of recognizable bifix codes
From MaRDI portal
Recommendations
Cited in
(21)- On maximal codes with bounded synchronization delay
- Maximal bifix codes
- Completing comma-free codes
- Completion of codes with finite bi-decoding delays.
- On maximal codes with a finite interpreting delay.
- Variable-length codes independent or closed with respect to edit relations
- Completing circular codes in regular submonoids
- On the maximality of languages with combined types of code properties
- scientific article; zbMATH DE number 1740160 (Why is no real title available?)
- scientific article; zbMATH DE number 1972782 (Why is no real title available?)
- A completion algorithm for codes with bounded synchronization delay
- Every regular bifix code is a finite union of regular infix codes
- Finite maximal solid codes
- When variable-length codes meet the field of error detection
- Generalizations of Code Languages with Marginal Errors
- Topologies for error-detecting variable-length codes
- An application of Hajós factorizations to variable-length codes
- Three-word codes \(\{a,aba,u\}\) having a finite completion
- Three-word codes \(\{a, aba, u\}\) and \(\{a, ab, v\}\) having finite completions
- Completing codes in a sofic shift
- Completing biprefix codes
This page was built for publication: Completion of recognizable bifix codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673111)
