One-Pass Complexity of Digital Picture Properties
From MaRDI portal
Publication:5661163
DOI10.1145/321694.321701zbMath0248.68040OpenAlexW2040688285MaRDI QIDQ5661163
Publication date: 1972
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321694.321701
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)
Related Items (13)
A survey of two-dimensional automata theory ⋮ A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines ⋮ Three-way tape-bounded two-dimensional Turing machines ⋮ Real-time recognition of two-dimensional tapes by cellular automata ⋮ Relation of one-way parallel/sequential automata to 2-D finite-state automata ⋮ Array automata and operations on array languages ⋮ Connectedness of coherent fuzzy pictures ⋮ Simple picture processing based on finite automata and regular grammars ⋮ Survey of research in the theory of homogeneous structures and their applications ⋮ Some properties of two-dimensional on-line tessellation acceptors ⋮ Parallel/sequential array automata ⋮ Two-dimensional alternative Turing machines ⋮ Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
This page was built for publication: One-Pass Complexity of Digital Picture Properties
