Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors

DOI10.1016/0304-3975(83)90048-8MaRDI QIDQ1054480zbMATH OpenOpenAlexFDO

Authors Manabu Toda, Katsushi Inoue, Itsuo Takanami

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90048-8

zbMATH Keywords

array matchingpattern matchingstring matchingtwo-dimensional automatatwo-dimensional deterministic on-line tessellation acceptor

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cites work

• A fast string searching algorithm
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• Efficient string matching
• Fast Pattern Matching in Strings
• Some properties of two-dimensional on-line tessellation acceptors

Cited in

(5)

• Two-dimensional on-line tessellation acceptors are not closed under complement
• Two-dimensional pattern matching against local and regular-like picture languages
• A survey of two-dimensional automata theory
• Complexity of sets of two-dimensional patterns
• Complexity of matching sets of two-dimensional patterns by two-dimensional on-line tessellation automaton

This page was built for publication: Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors

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