One-Pass Complexity of Digital Picture Properties

DOI10.1145/321694.321701MaRDI QIDQ5661163zbMATH OpenOpenAlexFDO

Authors Stanley Selkow

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Cited in

(13)

• 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
• Connectedness of coherent fuzzy pictures
• Survey of research in the theory of homogeneous structures and their applications
• Some properties of two-dimensional on-line tessellation acceptors
• Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
• Simple picture processing based on finite automata and regular grammars
• Parallel/sequential array automata
• A survey of two-dimensional automata theory
• Array automata and operations on array languages
• Two-dimensional alternative Turing machines

This page was built for publication: One-Pass Complexity of Digital Picture Properties

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