T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures

DOI10.1016/0031-3203(86)90058-0zbMath0595.68077MaRDI QIDQ1077942

Josef Pecht

Publication date: 1986

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(86)90058-0

zbMATH Keywords

systolic arrays; cellular automata; parallelism; d-dimensional formal languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68T10: Pattern recognition, speech recognition

68Q80: Cellular automata (computational aspects)

Related Items

A survey of two-dimensional automata theory

Cites Work

• A note on pattern reproduction in tessellation structures
• Real-time language recognition by one-dimensional cellular automata
• Linear Automaton Transformations
• A note on cellular automata simulations
• Maps preserving the uniformity of neighborhood interconnection patterns in tessellation structures
• Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Tessellation Automata
• Cellular automata complexity trade-offs
• Structural and behavioral equivalences of tessellation automata
• Some comments on neighborhood size for tessellation automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item