Full sets of pictures to encode pictures

DOI10.1016/J.TCS.2018.10.031zbMATH Open1423.68240OpenAlexW2898183845WikidataQ129036618 ScholiaQ129036618MaRDI QIDQ2422018FDOQ2422018

Authors: Marcella Anselmo, Dora Giammarresi, Maria 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

Recommendations

• Encoding pictures with maximal codes of pictures
• Strong prefix codes of pictures
• Two dimensional prefix codes of pictures
• Prefix picture codes: a decidable class of two-dimensional codes
• Structure and properties of strong prefix codes of pictures

zbMATH Keywords

codesformal languagescomplete setsencodingtwo-dimensional languagesprefix sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Title not available (Why is that?)
• The undecidability of the domino problem
• Tiling figures of the plane with two bars
• Computing and Combinatorics
• Undecidability and nonperiodicity for tilings of the plane
• Picture codes
• Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages
• Prefix picture codes: a decidable class of two-dimensional codes
• Two dimensional prefix codes of pictures
• A computational model for tiling recognizable two-dimensional languages
• A small aperiodic set of Wang tiles
• Decidability of multiset, set and numerically decipherable directed figure codes
• Succinct 2D dictionary matching
• Polyomino tilings, cellular automata and codicity
• A characterization of recognizable picture languages by tilings by finite sets
• A codicity undecidable problem in the plane.
• 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
• On the Undecidability of the Tiling Problem
• Infinite two-dimensional strong prefix codes: characterization and properties
• Strategies to scan pictures with automata based on Wang tiles
• Encoding pictures with maximal codes of pictures

Cited In (5)

• Sets of pictures avoiding overlaps
• Two-dimensional codes
• Non-expandable non-overlapping sets of pictures
• Encoding pictures with maximal codes of pictures
• Characterization and measure of infinite two-dimensional strong prefix codes

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)