Full sets of pictures to encode pictures
From MaRDI portal
Publication:2422018
DOI10.1016/j.tcs.2018.10.031zbMath1423.68240OpenAlexW2898183845MaRDI QIDQ2422018
Marcella Anselmo, Dora Giammarresi, Marina Madonia
Publication date: 18 June 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.031
Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (2)
Characterization and measure of infinite two-dimensional strong prefix codes ⋮ Two-dimensional codes
Cites Work
- Unnamed Item
- Unnamed Item
- Polyomino tilings, cellular automata and codicity
- A computational model for tiling recognizable two-dimensional languages
- A small aperiodic set of Wang tiles
- A characterization of recognizable picture languages by tilings by finite sets
- Tiling figures of the plane with two bars
- A codicity undecidable problem in the plane.
- Infinite two-dimensional strong prefix codes: characterization and properties
- Succinct 2D dictionary matching
- Undecidability and nonperiodicity for tilings of the plane
- Structure and Measure of a Decidable Class of Two-dimensional Codes
- Strong Prefix Codes of Pictures
- Structure and properties of strong prefix codes of pictures
- Strategies to scan pictures with automata based on Wang tiles
- Picture codes
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
- Computing and Combinatorics
- Encoding Pictures with Maximal Codes of Pictures
- PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
- Two Dimensional Prefix Codes of Pictures
- On the Undecidability of the Tiling Problem
- The undecidability of the domino problem
This page was built for publication: Full sets of pictures to encode pictures
