scientific article; zbMATH DE number 1496854

zbMATH Open0958.68146MaRDI QIDQ4500842FDOQ4500842

Authors: Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter 

Publication date: 19 April 2001

Title of this publication is not available (Why is that?)

Recommendations

• Pattern-matching problems for 2-dimensional images described by finite automata
• scientific article; zbMATH DE number 2185641
• On the complexity of pattern matching for highly compressed two-dimensional texts.
• The complexity of compressing subsegments of images described by finite automata

zbMATH Keywords

weighted finite automatacompressed matchingfully compressed pattern-checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Network design and communication in computer systems (68M10)

Cited In (3)

• The complexity of compressing subsegments of images described by finite automata
• Title not available (Why is that?)
• Pattern-matching problems for 2-dimensional images described by finite automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500842)