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

DOI10.1142/S012905411740010XzbMath1380.68258MaRDI QIDQ4605517

Daniel Průša

Publication date: 22 February 2018

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

zbMATH Keywords

picture languagesdescriptional complexitytwo-dimensional pattern matchingtwo-dimensional online tessellation automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Deterministic ordered restarting automata for picture languages
• 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
• Complexity of Sets of Two-Dimensional Patterns
• Efficient randomized pattern-matching algorithms
• 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
• Two-dimensional Sgraffito automata
• From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
• Implementation and Application of Automata
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton