Two-dimensional pattern matching against basic picture languages
From MaRDI portal
Publication:2177609
Recommendations
- Two-dimensional pattern matching against local and regular-like picture languages
- Complexity of sets of two-dimensional patterns
- Template-based pattern matching in two-dimensional arrays
- On two-dimensional pattern-matching languages and their decision problems
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
Cited in
(14)- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
- Two-dimensional codes
- On two-dimensional pattern-matching languages and their decision problems
- scientific article; zbMATH DE number 7584603 (Why is no real title available?)
- Exact and approximate matching of matrix languages
- On minimizing regular expressions without Kleene star
- Two-dimensional pattern matching against local and regular-like picture languages
- Template-based pattern matching in two-dimensional arrays
- Complexity of sets of two-dimensional patterns
- scientific article; zbMATH DE number 7770055 (Why is no real title available?)
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton
- Pattern-matching problems for 2-dimensional images described by finite automata
- A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
This page was built for publication: Two-dimensional pattern matching against basic picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177609)
