Two-dimensional pattern matching against local and regular-like picture languages
type: Item
instance of: scholarly article
title: Two-dimensional pattern matching against local and regular-like picture languages
zbMATH Open document ID: 1504.68109
author: František Mráz
author: Daniel Průša
author: Michael Wehar
published in: Theoretical Computer Science
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7354762
zbMATH Keywords: two-dimensional pattern matching
zbMATH Keywords: picture language
zbMATH Keywords: local picture language
zbMATH Keywords: two-dimensional finite automaton
zbMATH Keywords: triangle-finding problem
MaRDI profile type: Publication
full work available at URL: j.tcs.2020.12.026
OpenAlex ID: W3113919547
cites work: Q4385510
cites work: New operations and regular expressions for two-dimensional languages over one-letter alphabet
cites work: Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages
cites work: Fast two-dimensional pattern matching
cites work: Simple picture processing based on finite automata and regular grammars
cites work: Q4714446
cites work: Template-Based Pattern Matching in Two-Dimensional Arrays
cites work: Some properties of two-dimensional on-line tessellation acceptors
cites work: Q3128935
cites work: Efficient randomized pattern-matching algorithms
cites work: Fast context-free grammar parsing requires fast boolean matrix multiplication
cites work: Q5414549
cites work: Strategies to scan pictures with automata based on Wang tiles
cites work: Q4301161
cites work: Two-dimensional pattern matching against basic picture languages
cites work: Intersection non-emptiness and hardness within polynomial time
cites work: Lengths of words accepted by nondeterministic finite automata
cites work: Two-dimensional Sgraffito automata
cites work: Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
cites work: Q3710543
cites work: Decision problems for restricted variants of two-dimensional automata
cites work: Q3096201
cites work: Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
cites work: Multiplying matrices faster than coppersmith-winograd
cites work: Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
cites work: Finding Even Cycles Even Faster
DOI: 10.1016/J.TCS.2020.12.026
description: scientific article; zbMATH DE number 7354762