Regular expressions and context-free grammars for picture languages

被引：0
作者：
Matz, O [1 ]
机构：
[1] Univ Kiel, Inst Informat & Prakt Math, D-24098 Kiel, Germany
来源：
STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE | 1997年 / 1200卷
关键词：
formal languages; pictures languages; grammars; regular expressions;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We introduce a new concept of regular expression and context-free grammar for picture languages (sets of matrices over a finite alphabet) and compare and connect these two formalisms.
引用
收藏
页码：283 / 294
页数：12
相关论文
共 5 条
[1]   Monadic second-order logic over rectangular pictures and recognizability by tiling systems [J].
Giammarresi, D ;
Restivo, A ;
Seibert, S ;
Thomas, W .
INFORMATION AND COMPUTATION, 1996, 125 (01) :32-45
[2]  
Giammarresi D., 1992, International Journal of Pattern Recognition and Artificial Intelligence, V6, P241, DOI 10.1142/S021800149200014X
[3]  
GIAMMARRESI D, 1996, HDB FORMAL LANGUAGE, V3
[4]  
MATZ O, 1995, THESIS C ALBRECHTS U
[5]  
SIROMONEY R, 1987, ADV ARRAY LANGUAGES, V291, P549
1