Recognition of topological equivalence of patterns by array automata

DOI10.1016/0022-0000(80)90008-2zbMath0447.68052OpenAlexW2039982619MaRDI QIDQ1146519

S. Rao Kosaraju, Paul F. Dietz

Publication date: 1980

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(80)90008-2

zbMATH Keywords

algorithmarray automataBeyer's topological matching predicate

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80)

Related Items (2)

A survey of two-dimensional automata theory ⋮ Parallel and sequential transformations on digital images

Cites Work

• On Some Open Problems in the Theory of Cellular Automata
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

This page was built for publication: Recognition of topological equivalence of patterns by array automata