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

DOI10.1016/0020-0255(93)90039-OzbMath0796.68187OpenAlexW4231225572MaRDI QIDQ1803862

Yanyan Li

Publication date: 29 June 1993

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

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

zbMATH Keywords

connected binary picturesfinite-state acceptors

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Formal languages and automata (68Q45)

Related Items (2)

(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars ⋮ Non-recursive trade-offs between two-dimensional automata and grammars

Cites Work

• Three-dimensional connected pictures are not recognizable by finite-state acceptors
• Some properties of two-dimensional on-line tessellation acceptors
• Unnamed Item

This page was built for publication: Two-dimensional connected pictures are not recognizable by finite-state acceptors