Complexity of Sets of Two-Dimensional Patterns

DOI10.1007/978-3-319-40946-7_20zbMath1379.68229OpenAlexW2475414196MaRDI QIDQ2830224

Daniel Průša

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_20

zbMATH Keywords

picture languagesdescriptional complexitytwo-dimensional pattern matchingtwo-dimensional on-line tessellation automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton

Cites Work

• Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
• Fast two-dimensional pattern matching
• Some properties of two-dimensional on-line tessellation acceptors
• Efficient string matching
• 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
• Implementation and Application of Automata
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Complexity of Sets of Two-Dimensional Patterns