Full sets of pictures to encode pictures
From MaRDI portal
Publication:2422018
Recommendations
Cites work
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- A characterization of recognizable picture languages by tilings by finite sets
- A codicity undecidable problem in the plane.
- A computational model for tiling recognizable two-dimensional languages
- A small aperiodic set of Wang tiles
- Computing and Combinatorics
- Decidability of multiset, set and numerically decipherable directed figure codes
- Encoding pictures with maximal codes of pictures
- Infinite two-dimensional strong prefix codes: characterization and properties
- On the Undecidability of the Tiling Problem
- Picture codes
- Polyomino tilings, cellular automata and codicity
- Prefix picture codes: a decidable class of two-dimensional codes
- Strategies to scan pictures with automata based on Wang tiles
- Strong prefix codes of pictures
- Structure and measure of a decidable class of two-dimensional codes
- Structure and properties of strong prefix codes of pictures
- Succinct 2D dictionary matching
- The undecidability of the domino problem
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- Tiling figures of the plane with two bars
- Two dimensional prefix codes of pictures
- Undecidability and nonperiodicity for tilings of the plane
Cited in
(5)
This page was built for publication: Full sets of pictures to encode pictures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422018)