Three-dimensional connected pictures are not recognizable by finite-state acceptors

DOI10.1016/0020-0255(92)90094-OzbMath0782.68117OpenAlexW2062062521MaRDI QIDQ1205515

S. Singh

Publication date: 1 April 1993

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(92)90094-o

zbMATH Keywords

3D connected picturesfinite-state array acceptorsrecognition connectedness

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Related Items

(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars ⋮ Two-dimensional connected pictures are not recognizable by finite-state acceptors

Cites Work

• Unnamed Item
• Some properties of two-dimensional on-line tessellation acceptors
• Connected pictures are not recognizable by deterministic two-dimensional on-line tessellation acceptors