Regular Expressions and Context-Free Grammars for Picture Languages

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.

[1]  Rani Siromoney.  Advances in array languages , 1986, Graph-Grammars and Their Application to Computer Science.

[2]  Antonio Restivo,et al.  Recognizable Picture Languages , 1992, Int. J. Pattern Recognit. Artif. Intell..

[3]  Antonio Restivo,et al.  Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems , 1996, Inf. Comput..

[4]  Antonio Restivo,et al.  Two-Dimensional Languages , 1997, Handbook of Formal Languages.