Decision problems and regular chain code picture languages
type: Item
instance of: scholarly article
title: Decision problems and regular chain code picture languages
zbMATH Open document ID: 0797.68096
DOI: 10.1016/0166-218X(93)90138-E
author: Friedhelm Hinz
author: Jürgen Dassow
published in: Discrete Applied Mathematics
publication date: 1993-12-02T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 428346
zbMATH Keywords: picture languages
zbMATH Keywords: picture processing
zbMATH Keywords: string language
zbMATH Keywords: decidability
MaRDI profile type: Publication
cites work: An undecidable problem about rational sets and contour words of polyominoes
cites work: Q3277097
cites work: Q4206414
cites work: On the connectedness of pictures in chain code picture languages
cites work: Q4775507
cites work: Q5576254
cites work: Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
cites work: Q3976037
cites work: Q4734777
cites work: Q5592246
cites work: Complexity and decidability for restricted classes of picture languages
cites work: Picture iteration and picture ambiguity
cites work: The membership and equivalence problems for picture languages
cites work: Using string languages to describe picture languages
cites work: Complexity and decidability for chain code picture languages
full work available at URL: 0166-218x(93)90138-e
OpenAlex ID: W1969097186
Wikidata QID: Q128110999
description: scientific article; zbMATH DE number 428346