Each regular code is included in a maximal regular code
From MaRDI portal
Publication:3750132
Recommendations
Cited in
(32)- Variable-length codes independent or closed with respect to edit relations
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
- An application of Hajós factorizations to variable-length codes
- Maximal codes with bounded deciphering delay
- Three-word codes \(\{a, aba, u\}\) and \(\{a, ab, v\}\) having finite completions
- Embeddings of local automata
- The boxes
- On maximal synchronous codes.
- The meet operation in the lattice of codes
- Coding by minimal linear grammars
- On maximal codes with bounded synchronization delay
- Completing codes in a sofic shift
- A completion algorithm for codes with bounded synchronization delay
- On codes having no finite completion
- Full monoids and maximal codes
- Completing circular codes in regular submonoids
- Locally complete sets and finite decomposable codes
- Generating functions of circular codes
- Completing codes
- Three-word codes \(\{a,aba,u\}\) having a finite completion
- Completing comma-free codes
- On codes having no finite completion
- On maximal codes with a finite interpreting delay.
- Completing Wheeler automata
- Note on the topological structure of random strings
- When variable-length codes meet the field of error detection
- On completion of codes with finite deciphering delay
- Finite maximal solid codes
- Completing biprefix codes
- On codes with a finite deciphering delay: Constructing uncompletable words
- Embedding a -invariant code into a complete one
- Valuations of languages, with applications to fractal geometry
This page was built for publication: Each regular code is included in a maximal regular code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750132)
