Sets of pictures avoiding overlaps
From MaRDI portal
Publication:5205035
Recommendations
Cites work
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A New Approach to Cross-Bifix-Free Sets
- A codicity undecidable problem in the plane.
- A computational model for tiling recognizable two-dimensional languages
- A note on bifix-free sequences (Corresp.)
- A simple suboptimal construction of cross-bifix-free codes
- A survey on picture-walking automata
- A unifying approach to picture grammars
- Algorithms on Strings, Trees and Sequences
- Avoiding overlaps in pictures
- Codes and automata.
- Cross-Bifix-Free Codes Within a Constant Factor of Optimality
- Cross-bifix-free sets in two dimensions
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
- Jewels of Stringology
- Matrix-based complexity functions and recognizable picture languages
- Multiset, Set and Numerically Decipherable Codes over Directed Figures
- Non-expandable non-overlapping sets of pictures
- Non-overlapping matrices
- Picture codes
- Picture codes and deciphering delay
- Polyomino tilings, cellular automata and codicity
- Prefix picture codes: a decidable class of two-dimensional codes
- Strong prefix codes of pictures
- Structure and properties of strong prefix codes of pictures
- Two dimensional prefix codes of pictures
- Two-dimensional comma-free and cylindric codes
- Two-dimensional prefix string matching and covering on square matrices
- Unambiguous recognizable two-dimensional languages
- Unbordered pictures: properties and construction
Cited in
(5)
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)