Publication:3926078

From MaRDI portal


zbMath0471.68074MaRDI QIDQ3926078

Azriel Rosenfeld

Publication date: 1979



68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68Q45: Formal languages and automata

68T10: Pattern recognition, speech recognition

68Q80: Cellular automata (computational aspects)

68-02: Research exposition (monographs, survey articles) pertaining to computer science


Related Items

A NOTE ON REBOUND TURING MACHINES, LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES, A note on one-pebble two-dimensional Turing machines, Probabilistic rebound Turing machines, Semi-metrics, closure spaces and digital topology, A remark on two-dimensional finite automata, A note on decision problems for three-way two-dimensional finite automata, Relation of one-way parallel/sequential automata to 2-D finite-state automata, A characterization of context-free string languages by directed node- label controlled graph grammars, Some remarks on one-pebble rectangular array acceptors, A Jordan surface theorem for three-dimensional digital spaces, Machine characterization of (E0L-E0L) array languages, Graph grammars with path-controlled embedding, Connectedness of coherent fuzzy pictures, Three-dimensional connected pictures are not recognizable by finite-state acceptors, Digital Jordan curves---a graph-theoretical approach to a topological theorem, A note on alternative digital topologies, The topology of digital images, A note on two-dimensional probabilistic finite automata, A note on three-dimensional alternating Turing machines with space smaller than \(\log m\), Simulation of three-dimensional one-marker automata by five-way Turing machines, Retreat bounded picture languages, Network languages for intelligent control, Network languages for concurrent multiagent systems, Context-sensitive string languages and recognizable picture languages, A definition of surfaces of \({\mathbb{Z}}^{3}\). A new 3D discrete Jordan theorem, Leftmove-bounded picture languages, Centers of sets of pixels, Tree-based picture generation, Two-dimensional connected pictures are not recognizable by finite-state acceptors, Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines, A note on two-dimensional probabilistic Turing machines, Non-closure property of space-bounded two-dimensional alternating Turing machines, Complexity of perceptron recognition for a class of geometric patterns., On regular drawn symbolic picture languages, On piecewise linear approximation of planar Jordan curves, Some properties of one-pebble Turing machines with sublogarithmic space, Salient and reentrant points of discrete sets