Complexity and decidability for restricted classes of picture languages
type: Item
instance of: scholarly article
title: Complexity and decidability for restricted classes of picture languages
zbMATH Open document ID: 0694.68052
DOI: 10.1016/0304-3975(90)90180-P
author: Changwook Kim
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 4137342
zbMATH Keywords: formal language theory
zbMATH Keywords: complexity
zbMATH Keywords: decidability
zbMATH Keywords: picture languages
MaRDI profile type: Publication
cites work: Q3309090
cites work: Q4775507
cites work: Q3670607
cites work: Q4198075
cites work: Q5592246
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: Q3673129
cites work: A variant of a recursively unsolvable problem
cites work: Q3926078
cites work: Q5678435
cites work: Complexity and decidability for chain code picture languages
Wikidata QID: Q126382608
Recommended article: Complexity and decidability for chain code picture languages
Recommended article: The membership and equivalence problems for picture languages
Recommended article: Communication complexity tools on recognizable picture languages
Recommended article: Decidability of the consistency problem for regular symbolic picture description languages
Recommended article: On reversal-bounded picture languages
Recommended article: Q4649552
Recommended article: Decision Problems for Recognizable Languages of Infinite Pictures
Recommended article: On the Complexity of Unary Tiling-Recognizable Picture Languages
Recommended article: Q3086926
Recommended article: Q5414549
description: scientific article; zbMATH DE number 4137342