A unifying approach to picture grammars

Abstract Several old and recent classes of picture grammars, that variously extend context-free string grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such grammars can be unified and extended using an approach, whereby the right part of a rule is formalized by means of a finite set of permitted tiles. We focus on a simple type of tiling, named regional, and define the corresponding regional tile grammars. They include both Siromoneyʼs (or Matzʼs) Kolam grammars and their generalization by Průsa, as well as Drewesʼs grid grammars. Regionally defined pictures can be recognized with polynomial-time complexity by an algorithm extending the CKY one for strings. Regional tile grammars and languages are strictly included into our previous tile grammars and languages, and are incomparable with Giammarresi–Restivo tiling systems (or Wang systems).

[1]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[2]  Frank Drewes,et al.  Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid , 1996, J. Comput. Syst. Sci..

[3]  Rani Siromoney,et al.  Abstract families of matrices and picture languages , 1972, Comput. Graph. Image Process..

[4]  Daniel Pr̊uša.  Two-dimensional Context-free Grammars , 2006 .

[5]  V. Rajkumar Dare,et al.  Parallel Generation of Finite Images , 1989, Int. J. Pattern Recognit. Artif. Intell..

[6]  Matteo Pradella,et al.  A CKY parser for picture grammars , 2008, Inf. Process. Lett..

[7]  Grzegorz Rozenberg,et al.  Handbook of formal languages, vol. 3: beyond words , 1997 .

[8]  Stefano Varricchio,et al.  Recognizability of Rectangular Pictures by Wang Systems , 1998, J. Autom. Lang. Comb..

[9]  Matteo Pradella,et al.  Picture languages: Tiling systems versus tile rewriting grammars , 2006, Theor. Comput. Sci..

[10]  Rani Siromoney,et al.  Picture Languages with Array Rewriting Rules , 1973, Inf. Control..

[11]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[12]  Cristopher Moore,et al.  Complexity of Two-Dimensional Patterns , 1998 .

[13]  Matteo Pradella,et al.  Regional Languages and Tiling: A Unifying Approach to Picture Grammars , 2008, MFCS.

[14]  Oliver Matz,et al.  Regular Expressions and Context-Free Grammars for Picture Languages , 1997, STACS.

[15]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[16]  Matteo Pradella,et al.  Tile rewriting grammars and picture languages , 2005, Theor. Comput. Sci..

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

[18]  Harry R. Lewis,et al.  Complexity of solvable cases of the decision problem for the predicate calculus , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[19]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[20]  Hans-Jörg Kreowski,et al.  Computing Raster Images from Grid Picture Grammars , 2000, CIAA.

[21]  Kamala Krithivasan,et al.  Pattern Matching in Matrix Grammars , 1998, J. Autom. Lang. Comb..

[22]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

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

[24]  David Simplot-Ryl.  A Characterization of Recognizable Picture Languages by Tilings by Finite Sets , 1999, Theor. Comput. Sci..