Pages that link to "Item:Q3750132"

The following pages link to Each regular code is included in a maximal regular code (Q3750132):

Displaying 28 items.

• An application of Hajós factorizations to variable-length codes (Q671432) (← links)
• Valuations of languages, with applications to fractal geometry (Q674334) (← links)
• Embeddings of local automata (Q716395) (← links)
• Completing codes in a sofic shift (Q732037) (← links)
• On completion of codes with finite deciphering delay (Q757324) (← links)
• Completing biprefix codes (Q790624) (← links)
• The boxes (Q805238) (← links)
• The meet operation in the lattice of codes (Q1127316) (← links)
• Maximal codes with bounded deciphering delay (Q1177932) (← links)
• Note on the topological structure of random strings (Q1210302) (← links)
• On maximal codes with bounded synchronization delay (Q1275457) (← links)
• Generating functions of circular codes (Q1277204) (← links)
• Completing comma-free codes (Q1399997) (← links)
• On maximal synchronous codes. (Q1426041) (← links)
• On maximal codes with a finite interpreting delay. (Q1605334) (← links)
• Locally complete sets and finite decomposable codes (Q1605335) (← links)
• Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
• Coding by minimal linear grammars (Q2192369) (← links)
• Embedding a \(\theta \)-invariant code into a complete one (Q2285122) (← links)
• Completing circular codes in regular submonoids (Q2474228) (← links)
• Full monoids and maximal codes (Q2841976) (← links)
• Completing codes (Q3823514) (← links)
• On codes having no finite completion (Q4341033) (← links)
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS (Q4464961) (← links)
• A completion algorithm for codes with bounded synchronization delay (Q4571942) (← links)
• On codes having no finite completion (Q4763927) (← links)
• On codes with a finite deciphering delay: Constructing uncompletable words (Q5941067) (← links)
• Finite maximal solid codes (Q5958127) (← links)