scientific article; zbMATH DE number 3386919

zbMath0244.68032MaRDI QIDQ5656399

David L. Milgram, Azriel Rosenfeld

Publication date: 1972

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Turing machines and related notions (03D10)

Related Items (23)

T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures ⋮ Direction-independent grammars with contexts ⋮ 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 ⋮ Real-time recognition of two-dimensional tapes by cellular automata ⋮ Some new results on isotonic array grammars ⋮ Two-dimensional automata with rotated inputs ⋮ Sequential and cellular graph automata ⋮ Parallel language recognition in constant time by cellular automata ⋮ Three-way two-dimensional alternating finite automata with rotated inputs ⋮ Grammars on partial graphs ⋮ Formal languages of labelled graphs ⋮ The behavioral properties of homogeneous structures ⋮ Toward a mathematical theory of graph-generative systems and its applications ⋮ Recursiveness of monotonic array grammars and a hierarchy of array languages ⋮ Some properties of two-dimensional on-line tessellation acceptors ⋮ A note on two-dimensional finite automata ⋮ Structural pattern recognition, homomorphisms, and arrangements ⋮ An application of formal linguistics to scene recognition ⋮ Normal form of extended table matrix L systems ⋮ Tesselations with local transformations ⋮ Parallel/sequential array automata ⋮ The complexity of some decision problems about two-dimensional array grammars

This page was built for publication: