Pages that link to "Item:Q673111"
From MaRDI portal
The following pages link to Completion of recognizable bifix codes (Q673111):
Displayed 15 items.
- On the maximality of languages with combined types of code properties (Q401313) (← links)
- An application of Hajós factorizations to variable-length codes (Q671432) (← links)
- On maximal codes with bounded synchronization delay (Q1275457) (← links)
- Maximal bifix codes (Q1292485) (← links)
- Completing comma-free codes (Q1399997) (← links)
- Completion of codes with finite bi-decoding delays. (Q1426443) (← links)
- On maximal codes with a finite interpreting delay. (Q1605334) (← links)
- Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
- Completing circular codes in regular submonoids (Q2474228) (← links)
- A completion algorithm for codes with bounded synchronization delay (Q4571942) (← links)
- (Q4988158) (← links)
- Finite maximal solid codes (Q5958127) (← links)
- When variable-length codes meet the field of error detection (Q6108733) (← links)
- Generalizations of Code Languages with Marginal Errors (Q6114833) (← links)
- Topologies for error-detecting variable-length codes (Q6186320) (← links)