On a question concerning certain free submonoids
From MaRDI portal
Cited in
(12)- An answer to a question about finite maximal prefix sets of words
- About prefix sets of words
- Maximal codes with bounded deciphering delay
- Completion of codes with finite bi-decoding delays.
- On maximal codes with a finite interpreting delay.
- Codes induced by alternative codes
- Maximal prefix products
- Embedding a -invariant code into a complete one
- On infinitary finite length codes
- Homomorphisms preserving deterministic context-free languages
- Synchronization and simplification
- On completion of codes with finite deciphering delay
This page was built for publication: On a question concerning certain free submonoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540495)