scientific article

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

digital geometry array grammars two-dimensional automata language hierarchies cellular array acceptors recognizing devices sequential array acceptors

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Cellular automata (computational aspects) (68Q80) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Three-way automata on rectangular types over a one-letter alphabet, Contextual array grammars with matrix control, regular control languages, and tissue P systems control, Direction-independent application of productions on two-dimensional arrays, Complexity of perceptron recognition for a class of geometric patterns., Simulation of three-dimensional one-marker automata by five-way Turing machines, On regular drawn symbolic picture languages, Retreat bounded picture languages, Context dependent table matrix L systems, Concatenation operations and restricted variants of two-dimensional automata, On pebble automata, A hierarchy of random-context grammars and automata, On piecewise linear approximation of planar Jordan curves, On two-dimensional pattern-matching languages and their decision problems, Direction-independent grammars with contexts, Several properties of array languages, A CKY parser for picture grammars, The membership and equivalence problems for picture languages, Detection of interlocking components in three-dimensional digital pictures, Predecessor states for certain cellular automata evolutions, Random context structure grammars and automata - a formal approach, A survey of two-dimensional automata theory, A characterization of constant-time cellular automata computation, Network languages for intelligent control, Network languages for concurrent multiagent systems, A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional Turing machines, Multiset random context grammars, checkers, and transducers, Context-sensitive string languages and recognizable picture languages, On the power of permitting features in cooperating context-free array grammar systems, Non-isometric Contextual Array Grammars with Regular Control and Local Selectors, A definition of surfaces of ${\mathbb{Z}}^{3}$. A new 3D discrete Jordan theorem, A remark on two-dimensional finite automata, A 3D digital Jordan-Brouwer separation theorem, A note on decision problems for three-way two-dimensional finite automata, A $P$ system model with pure context-free rules for picture array generation, 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, Digital Jordan curves, Some remarks on one-pebble rectangular array acceptors, Complexity and decidability for restricted classes of picture languages, Picture iteration and picture ambiguity, Acceptors for isometric parallel context-free array languages, Array-Rewriting P Systems with Basic Puzzle Grammar Rules and Permitting Features, A note on three-dimensional finite automata, A note on time-bounded bottom-up pyramid cellular acceptors, Computer graphics and connected topologies on finite ordered sets, A new hierarchy of two-dimensional array languages, 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, A Jordan Curve Theorem in the Digital Plane, A convenient graph connectedness for digital imagery, Semi-metrics, closure spaces and digital topology, Contextual array grammars and array P systems, Convenient adjacencies for structuring the digital plane, A General Framework for Regulated Rewriting Based on the Applicability of Rules, Slender Siromoney matrix languages, A quotient-universal digital topology, Alexandroff pretopologies for structuring the digital plane, Picture deformation, 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, Pure 2D picture grammars and languages, Picture languages: tiling systems versus tile rewriting grammars., Complexity-theoretic aspects of expanding cellular automata, Decision problems and projection languages for restricted variants of two-dimensional automata, A proof of image Euler number formula, A tutorial on well-composedness, Two-dimensional connected pictures are not recognizable by finite-state acceptors, Satisfiability via Smooth Pictures, Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines, A note on two-dimensional probabilistic Turing machines, Contextual Array Grammars with Matrix and Regular Control, Leftmove-bounded picture languages, Centers of sets of pixels, Two-dimensional models, Pictures of functions and their acceptability by automata, Infinite arrays and infinite computations, Some properties of one-pebble Turing machines with sublogarithmic space, Tree-based picture generation, A note on two-dimensional probabilistic finite automata, On a relationship between graph L-systems and picture languages, ``Shape theory and Pattern Recognition, Salient and reentrant points of discrete sets, An application of array grammars to clustering analysis for syntactic patterns, A note on array grammars, Two-dimensional alternative Turing machines, Complexity and decidability for chain code picture languages, A note on three-dimensional alternating Turing machines with space smaller than $\log m$, Non-closure property of space-bounded two-dimensional alternating Turing machines, The complexity of some decision problems about two-dimensional array grammars, Parallel and sequential transformations on digital images, On the complexity of the recognition of parallel 2D-image languages, A note on an extension of matrix grammars generating two-dimensional languages, Path-induced closure operators on graphs for defining digital Jordan surfaces, Computation theory of cellular automata, Degrees of restriction for two-dimensional automata, Fast parallel language recognition by cellular automata, Syntactic/semantic techniques in pattern recognition: A survey, Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata, Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change, Unnamed Item, Some results concerning two-dimensional turing machines and finite automata, The equivalence of pebbles and sensing heads for finite automata, A closure operator for the digital plane, Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats, Parallel contextual array insertion deletion grammars, pure 2D context-free grammars and associated P systems, Array P systems and pure 2D context-free grammars with independent mode of rewriting, An Overview of 2D Picture Array Generating Models Based on Membrane Computing, A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages, An array P system based on a new variant of pure 2D context-free grammars, Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change, Unnamed Item, Complete symmetry in d2l systems and cellular automata, LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES, A note on one-pebble two-dimensional Turing machines, A note on one-pebble two-dimensional Turing machines, Relations between Control Mechanisms for Sequential Grammars1, A Three-Dimensional Uniquely Parsable Array Grammar that Generates and Parses Cubes, A NOTE ON REBOUND TURING MACHINES, Complexity-theoretic aspects of expanding cellular automata, Probabilistic rebound Turing machines, Selected Decision Problems for Square-Refinement Collage Grammars, A Survey on Picture-Walking Automata, Jordan Curve Theorems with Respect to Certain Pretopologies on $\mathbb Z^2$, Digital Jordan Curves and Surfaces with Respect to a Closure Operator, Two-dimensional Sgraffito automata, An alternative digital topology, Salient and Reentrant Points of Discrete Sets, Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata