QUESTIONS OF DECIDABILITY FOR CONTEXT-FREE CHAIN CODE PICTURE LANGUAGES

被引：0
作者：
HINZ, F [1 ]
机构：
[1] GRAZ UNIV TECHNOL,INST INFORMAT PROC,A-8010 GRAZ,AUSTRIA
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 381卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：2 / 11
页数：10
相关论文
共 11 条
[1]  
Freeman H., 1974, Computing Surveys, V6, P57, DOI 10.1145/356625.356627
[2]  
HINZ F, 1988, 252 GRAZ U TECHN I F
[3]  
HINZ F, THESIS
[4]   THE MEMBERSHIP AND EQUIVALENCE PROBLEMS FOR PICTURE LANGUAGES [J].
KIM, C ;
SUDBOROUGH, IH .
THEORETICAL COMPUTER SCIENCE, 1987, 52 (03) :177-191
[5]  
KIM C, IN PRESS TCS
[6]   RECURSIVE UNSOLVABILITY OF POSTS PROBLEM OF TAG AND OTHER TOPICS IN THEORY OF TURING MACHINES [J].
MINSKY, ML .
ANNALS OF MATHEMATICS, 1961, 74 (03) :437-+
[7]  
ROSENFELD A, 1979, PICTURE LANGUAGES
[8]   A FORMAL PICTURE DESCRIPTION SCHEME AS A BASIS FOR PICTURE PROCESSING SYSTEMS [J].
SHAW, AC .
INFORMATION AND CONTROL, 1969, 14 (01) :9-&
[9]  
SUDBOROUGH IH, 1985, THEORETICAL COMPUTER, V36, P175
[10]  
WELZL E, 1982, INFORM CONTR, V54, P155
12