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

DOI10.1016/0304-3975(83)90048-8zbMath0519.68071OpenAlexW1989809496MaRDI QIDQ1054480

Katsushi Inoue, Itsuo Takanami, Manabu Toda

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

string matchingpattern matchingtwo-dimensional automataarray matchingtwo-dimensional deterministic on-line tessellation acceptor

Mathematics Subject Classification ID

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

Related Items (5)

A survey of two-dimensional automata theory ⋮ Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton ⋮ Two-dimensional on-line tessellation acceptors are not closed under complement ⋮ Two-dimensional pattern matching against local and regular-like picture languages ⋮ Complexity of Sets of Two-Dimensional Patterns

Cites Work

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

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