Tile rewriting grammars and picture languages
Stefano Crespi Reghizzi2005, Theoretical Computer Science
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Tile Rewriting Grammars (TRG) are a new model for defining picture languages. A rewriting rule changes a homogeneous rectangular subpicture into a isometric one tiled with specified tiles. Derivation and language generation with TRG rules are similar to contextfree grammars. A normal form and some closure properties are presented. We prove this model has greater generative capacity than the Tiling Systems of Giammarresi and Restivo and the grammars of Matz, another generalization of context free string grammars to 2D. Examples are shown for pictures made by nested frames and spirals.
Related papers
Picture languages: Tiling systems versus tile rewriting grammars
Theoretical Computer Science, 2006
Two formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling systems and tile rewriting grammars, which resp. extend to 2D the regular and context-free languages. Two results extending classical language properties into 2D are proved. First, non-recursive tile writing grammars (TRG) coincide with tiling systems (TS). Second, non-self-embedding TRG are suitably defined as corner grammars, showing that they generate TS languages. The proofs exploit newly introduced language substitutions, also nested and iterated.
Picture Languages Generated by Assembling Tiles
Lecture Notes in Computer Science, 2009
We propose a new model for defining picture languages inspired by the idea of formalizing an assembly mechanism of tiles based on rules. More precisely, a picture language will be generated from a finite set of initial pictures by iteratively applying rewriting rules from a given finite set of rules, called a tiling rule system ( t-RS system). We prove this model has greater generative capacity than the tiling systems of Giammarresi and Restivo, even in the case they generate one-letter alphabet picture languages. Using tiling rules systems we are able to show a different way of assembling recognizable pictures languages w.r.t. the one of non recognizable languages.
A unifying approach to picture grammars
Information and Computation, 2011
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 a tiling based 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ůša, as well as Drewes's grid grammars. Regionally defined pictures can be recognized with polynomialtime 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).
Pure 2D picture grammars and languages
Discrete Applied …, 2009
A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced based on the notion of pure context-free string grammar. The rectangular picture generative power of this 2D grammar model is investigated. Certain closure properties are obtained. An analogue of this 2D grammar model called pure 2D hexagonal context-free grammar (P2DHCFG) is also considered to generate hexagonal picture arrays on triangular grids.
Regional Languages and Tiling: A Unifying Approach to Picture Grammars
Lecture Notes in Computer Science
Several classical models of picture grammars based on array rewriting rules can be unified and extended by a tiling based approach. The right part of a rewriting rule is formalized by 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ůša. 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 the tile grammars and languages, and are incomparable with Giammarresi-Restivo tiling systems (or Wang's tilings).
Using graph grammars for generative process recreating Warsaw's traditional floor tiling
2018
Artists have looked for inspiration in dreams for ages. There are multiple examples of dream-inspired literature, paintings, music, or even comic books. Modern art movements like symbolism have often reacted against realism and explored a world of imagination and spirituality. Sigmund Freud's psychoanalysis has had a great impact on culture, as many artists, e.g. surrealists, have started to refer to unconsciousness. Carl Gustav Jung emphasised correlation between dreams and art as he saw them both as expressions of unconscious. This paper presents a generative tool that makes it possible to create dynamic graphics on the basis of dreams [1]. The idea of dynamic graphics has been introduced in [2] as an attempt to capture the process of visual design, during which a designer adds and removes components, as well as modifies their properties until the required result is obtained. Because each modification is recorded as a film frame, the whole process is finally illustrated by an animation. According to Gestalt psychology, each component of a dream represents a significant part of the dream owner and brings a message from unconsciousness about their emotions, problems or even possible solutions. Our tool provides a graphical interface that enables the user to illustrate their dream. Dream components (people, animals, places, things, etc.) are represented by symbolic shapes of different colours and can be located anywhere on the canvas. Every scene of a dream is represented by a configuration of components and constitutes a frame of animation. Having visualized their dream that way, a user can watch its action on a film. Automatically generated frames between the user-defined key frames representing scenes are interesting from both aesthetic and psychological point of view. They illustrate the dynamics of a dream, in which objects move, disappear, appear or transform into different things. While such transitions may be difficult to realize during psychological dream work, they can be treated as a dream component and be a valuable subject to analysis and interpretation. The graphics derived from in-between frames help to capture transitions. The proposed computer program generates images whose irrationality reflects reversed logic of a dream on the basis of real people's experience. The obtained visualisations can be regarded as original pieces of dream-inspired artwork, as inspiration for artist's creativity or as a psychological tool for dream work and introspection.
Computing Raster Images from Grid Picture Grammars
Lecture Notes in Computer Science, 2001
While a 2-dimensional grid picture grammar may generate pictures (de ned as subsets of the unit square) with arbitrarily small details, only a nite number of them can be made visible as raster images for any given raster. We present an algorithm based on bottom-up tree automata which computes the set of all raster images of the pictures generated by a given grid picture grammar.
Language Theoretic and Algorithmic Properties ofd-dimensional Collages and Patterns in a Grid
Journal of Computer and System Sciences, 1996
Language theoretic aspects and algorithmic properties of particular classes of context-free collage languages and of patterns generated by iterated function systems are studied. These classes are defined by restricting the allowed transformations to a sort of similarity transformations called grid transformations. It turns out that, thanks to this restriction, the language classes have nice closure properties, and non-trivial questions concerning the generated pictures can be decided.
New models for recognition of picture languages: Sgraffito and restarting tiling automata
We introduce two new models of two-dimensional computing devices called sgraffito automaton and restarting tiling automaton. The models fulfill two conditions. Firstly, they do not exceed the power of finite-state automata when working over one-dimensional inputs. And secondly, they allow a clear design of important computations. We study properties of the induced families of picture languages. We show that they include strictly REC and that restarting tiling automata are able to simulate sgraffito automata. An interesting family is settled by deterministic sgraffito automata. It can be seen as an alternative to DREC.
Tree-based picture generation
Theoretical Computer Science, 2000
The concept of tree-based picture generation is introduced. It is shown that there are equivalent tree-based de nitions of four picture-generating devices known from the literature, namely collage grammars, iterated function systems, context-free chain-code grammars, and 0L-systems with turtle interpretation. Furthermore, generalisations of each of these systems are discussed.
Related papers
Regional Hexagonal Tile Rewriting Grammars
Lecture Notes in Computer Science, 2012
Regional hexagonal Tile rewriting grammars(RHTRG) are the recently introduced hexagonal picture generating devices which used a simple type of tiling called regional hexagonal tiling. This model is having isometric rules of derivation and more general than context-free Hexagonal array grammars (HAG) but incomparable with hexagonal tiling systems (HTS). In this paper we compare RHTRG with some parallel generating formalisms like Extended pure 2D hexagonal context-free grammars with regular control and hexagonal array token Petri net Structure with respect to generating capacity..
Generative Aspects of Oxide Pictures by Oxide Tile Rewriting Grammar
International Journal of Recent Technology and Engineering
In formal languages, picture language is generalization of string language theory to two dimensions. Pictures which may be regarded as two-dimensional objects occur in studies concerning recognition of patterns, images and various computational fields. Several studies have been done for generating and/or recognizing higher dimensional objects using formal models. Tile rewriting grammar (TRG) is yet another model introduced for generating picture languages. TRG combines isometric rewriting rules with the Giammaresi and Restivo’s Tiling system. This rewriting grammar generates spirals, square and rectangular grids. The power of generating pictures by tile rewriting grammar is more than REC .Sweety et al have generated hexagonal pictures, introducing hexagonal Tile Rewriting Grammar. Kuberalet al have introduced Triangular Tile Rewriting Grammar to generate Triangular Pictures. A special class of objects namely Oxide pictures have been of interest recently. Oxide network is a special c...
A Variant of Extended Two-dimensional Context-free Picture Grammar
2016
Here we introduce a variant of extended two-dimensional context-free picture grammar (E2DCF P G), called (l/u)E2DCF P G which allows rewriting only the leftmost column, or the uppermost row of variables in a picture array. Several theoretical properties of (l/u)E2DCF P G are obtained and an application in generating digitized picture arrays is discussed.
Applying formal picture languages to procedural content generation
2015 Computer Games: AI, Animation, Mobile, Multimedia, Educational and Serious Games (CGAMES), 2015
Procedural content generation for games often uses tile sets. Tilings generated with tile sets are equivalent to pictures generated from a fixed alphabet of characters such as those explored in the area of vision. Formal languages over pictures and their methods of definition such as 2D regular expressions, automata, and array grammars are directly applicable to generation of tilings using finite tile sets. Though grammars such as string grammars, L-systems, and graph grammars have been explored and found useful for the definition of certain content, formal methods have mostly been ignored. We introduce 2D regular expressions and array grammars as generators. We reason about the theoretical capability of these constructs and develop some practical use cases for their application in procedural content generation for games.
Generative models for pictures tiled by triangles
The problem of generation of triangle-tiled pictures that are two-dimensional figures tiled by isosceles right triangles of the same size, is investigated. Grammars called context-free triangle-tiled picture grammars (CF-ttPG) that generate such figures making use of context-free type rules, are proposed. The special case that all rules of such a grammar are regular, is studied. In the framework of membrane computing which is a biologically inspired computability model, generation of triangle-tiled pictures by rules of a CF-ttPG is considered. The picture language of rectangular hollow frames which cannot be generated by any CF-ttPG, can be generated by a specific type of P system with two membranes.
Two-dimensional picture grammar models
… on Computer Modeling …, 2008
A new theoretical model of grammatical picture generation called extended 2D context-free picture grammar (E2DCFPG) generating rectangular picture arrays of symbols is introduced. This model which allows variables in the grammar and uses the squeezing mechanism offorming the picture language over terminal symbols, is an extension of the pure 2D context-free picture grammar (P2DCFPG) . The extended picture grammar model E2DCFPG is shown to have more picture generative power than the P2DCFPG and certain other existing 2D models. Certain closure and other properties of this new model are also examined 978-0-7695-3325-4/08 $25.00
A system model with pure context-free rules for picture array generation
Mathematical and Computer Modelling, 2010
Syntactic models constitute one of the main areas of mathematical studies on picture array generation. A number of 2D grammar models have been proposed motivated by a variety of applications. A P system is a biologically motivated new computing model, proposed by Păun in the area of membrane computing. It is a rich framework for dealing with different problems, including the problem of handling picture array generation. In this paper, the generative power of the array-rewriting P system with pure 2D context-free rules is investigated by comparing it with other 2D grammar models, thus bringing out the suitability of this P system model for picture array generation.
Picture grammar for Santal floor design as radial language
Malaya Journal of Matematik, 2019
In this paper the application of two dimensional picture grammars for generating traditional Sohrai floor design of Santal is explored. Context-free picture grammars are able to yield most of the floor designs. Based on the concept of radial languages, a Q-i (quadrant-i) radial language model is proposed in this work. Further, the tiling operators are used to generate the composite two-dimensional words.
Recognizable picture languages and domino tiling
Theoretical Computer Science, 1997
In [2], Giammarresi and Restivo define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over C U {#} where # is a boundary symbol which surrounds the pictures. Then they define the class of recognizable picture languages as the set of languages which can be obtained by projection of a local one. This class is of interest since it admits several quite different characterizations . Here, we define the hv-local picture languages where 2 x 2 tiles are replaced by horizontal and vertical dominoes. So the horizontal and the vertical scanning can be done separately. However, we prove that every recognizable picture language can be obtained as a projection of a hv-local language.
A P system model with pure context-free rules for picture array generation
Mathematical and Computer Modelling, 2010
Syntactic models constitute one of the main areas of mathematical studies on picture array generation. A number of 2D grammar models have been proposed motivated by a variety of applications. A P system is a biologically motivated new computing model, proposed by Păun in the area of membrane computing. It is a rich framework for dealing with different problems, including the problem of handling picture array generation. In this paper, the generative power of the array-rewriting P system with pure 2D context-free rules is investigated by comparing it with other 2D grammar models, thus bringing out the suitability of this P system model for picture array generation.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.