Complexity of sets of two-dimensional patterns
From MaRDI portal
Recommendations
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
- Two-dimensional pattern matching against basic picture languages
- Two-dimensional pattern matching against local and regular-like picture languages
- Implementation and Application of Automata
- Implementation and Application of Automata
Cites work
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- An introduction to Kolmogorov complexity and its applications
- Efficient string matching
- Fast two-dimensional pattern matching
- Implementation and Application of Automata
- Some properties of two-dimensional on-line tessellation acceptors
- Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
Cited in
(8)- Two-dimensional pattern matching against local and regular-like picture languages
- Two-dimensional pattern matching against basic picture languages
- scientific article; zbMATH DE number 5855012 (Why is no real title available?)
- scientific article; zbMATH DE number 4049111 (Why is no real title available?)
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
- Exploring 2D Shape Complexity
- Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes
- Implementation and Application of Automata
This page was built for publication: Complexity of sets of two-dimensional patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830224)
