Sets of pictures avoiding overlaps

DOI10.1142/S0129054119400215zbMATH Open1427.68137WikidataQ127226511 ScholiaQ127226511MaRDI QIDQ5205035FDOQ5205035

Authors: Marcella Anselmo, Dora Giammarresi, Maria Madonia 

Publication date: 10 December 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• Avoiding overlaps in pictures
• Non-expandable non-overlapping sets of pictures
• Unbordered pictures: properties and construction
• Avoidance of split overlaps
• Full sets of pictures to encode pictures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Jewels of Stringology
• Two-dimensional prefix string matching and covering on square matrices
• Avoiding overlaps in pictures
• A simple suboptimal construction of cross-bifix-free codes
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• Unbordered Pictures: Properties and Construction
• A survey on picture-walking automata
• Picture codes
• Non-expandable non-overlapping sets of pictures
• A note on bifix-free sequences (Corresp.)
• Picture codes and deciphering delay
• PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
• A New Approach to Cross-Bifix-Free Sets
• Two Dimensional Prefix Codes of Pictures
• Cross-Bifix-Free Codes Within a Constant Factor of Optimality
• A unifying approach to picture grammars
• Two-dimensional comma-free and cylindric codes
• Non-overlapping matrices
• A computational model for tiling recognizable two-dimensional languages
• Codes and automata.
• Polyomino tilings, cellular automata and codicity
• A codicity undecidable problem in the plane.
• Strong Prefix Codes of Pictures
• Unambiguous recognizable two-dimensional languages
• Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
• Cross-bifix-free sets in two dimensions
• Structure and properties of strong prefix codes of pictures
• Matrix-based complexity functions and recognizable picture languages

Cited In (3)

• Non-expandable non-overlapping sets of pictures
• Density of \(k\)-ary words with 0, 1, 2-error overlaps
• Isometric words and edit distance: main notions and new variations

This page was built for publication: Sets of pictures avoiding overlaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205035)