Picture codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5141495 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 2068875 (Why is no real title available?)
- A characterization of recognizable picture languages by tilings by finite sets
- A codicity undecidable problem in the plane.
- Context-sensitive string languages and recognizable picture languages
- Infinite arrays and controlled deterministic table 0L array systems
- Infinite arrays and infinite computations
- Polyomino tilings, cellular automata and codicity
- Recognizable picture languages and domino tiling
- Star-free picture expressions are strictly weaker than first-order logic
Cited in
(12)- Characterization and measure of infinite two-dimensional strong prefix codes
- Tiling of toroidal arrays with pictures: uniqueness, shift-equivalence and undecidability
- Unbordered pictures: properties and construction
- Sets of pictures avoiding overlaps
- Two-dimensional codes
- Toroidal codes and conjugate pictures
- Full sets of pictures to encode pictures
- Picture deformation
- Non-expandable non-overlapping sets of pictures
- Picture codes and deciphering delay
- Two-dimensional comma-free and cylindric codes
- Structure and properties of strong prefix codes of pictures
This page was built for publication: Picture codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423135)
