Picture codes and deciphering delay
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 709438 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3328721 (Why is no real title available?)
- A characterization of recognizable picture languages by tilings by finite sets
- A codicity undecidable problem in the plane.
- Computing and Combinatorics
- Decidability of code properties
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- Error-correction, and finite-delay decodability
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- Picture codes
- Picture codes with finite deciphering delay
- Polyomino tilings, cellular automata and codicity
- Prefix picture codes: a decidable class of two-dimensional codes
- Strong prefix codes of pictures
- Two dimensional prefix codes of pictures
- Unambiguous recognizable two-dimensional languages
Cited in
(7)
This page was built for publication: Picture codes and deciphering delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515672)