On infinitary finite length codes
From MaRDI portal
Publication:3765256
Recommendations
Cites work
- scientific article; zbMATH DE number 3919854 (Why is no real title available?)
- scientific article; zbMATH DE number 3707805 (Why is no real title available?)
- scientific article; zbMATH DE number 3745092 (Why is no real title available?)
- scientific article; zbMATH DE number 3786156 (Why is no real title available?)
- scientific article; zbMATH DE number 3526595 (Why is no real title available?)
- scientific article; zbMATH DE number 3566723 (Why is no real title available?)
- scientific article; zbMATH DE number 3633741 (Why is no real title available?)
- scientific article; zbMATH DE number 3215740 (Why is no real title available?)
- scientific article; zbMATH DE number 3373622 (Why is no real title available?)
- A note on uniquely decipherable codes (Corresp.)
- Adherences of languages
- On a question concerning certain free submonoids
- On ω-regular sets
- Sous-monoides et codes avec des mots infinis
Cited in
(24)- scientific article; zbMATH DE number 2068875 (Why is no real title available?)
- scientific article; zbMATH DE number 33205 (Why is no real title available?)
- Finitary Codes, a short survey
- Invariants of finitary isomorphisms with finite expected code-lengths
- A defect property of codes with unbounded delays
- Decidability of code properties
- Bi-infinitary codes
- Finitary codes for biinfinite words
- Homomorphisms preserving deterministic context-free languages
- On codes having no finite completion
- One-relation languages and code generators
- Decidability of code properties
- Prefix-free languages as \(\omega\)-generators
- scientific article; zbMATH DE number 1528667 (Why is no real title available?)
- Asymptotically good codes have infinite trellis complexity
- Valuations and unambiguity of languages, with applications to fractal geometry
- On codes, -codes and -generators
- Variable-length codes for error correction
- Minimal generators of submonoids of $A^\infty $
- Infinite two-dimensional strong prefix codes: characterization and properties
- Codes, simplifying words, and open set condition
- Rebootable and suffix-closed $\omega $-power languages
- Valuations of languages, with applications to fractal geometry
- On a class of infinitary codes
This page was built for publication: On infinitary finite length codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765256)