Partial array-rewriting P systems and basic puzzle partial array grammars [PDF]
In literature the innovative model of partial array languages and partial array rewriting rules are existing, earlier we have defined regular partial array grammar and context free partial array grammar to generate partial array languages. Here, the concept of basic puzzle partial array grammar is introduced to generate partial array languages.
F. Sweety+3 more
semanticscholar +4 more sources
Tiling Systems versus Tile Rewriting Grammars
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,
A Cherubini+3 more
semanticscholar +6 more sources
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars [PDF]
The type of a minimalist grammar (MG) as introduced by Stabler [11,12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB-theory to minimalism.
Jens Michaelis
semanticscholar +5 more sources
The Graph Grammar Library - A Generic Framework for Chemical Graph Rewrite Systems [PDF]
Extended version of an abstract published in proceedings of the International Conference on Model Transformation (ICMT ...
Mann, Martin+2 more
+10 more sources
Combinatory Categorial Grammars [PDF]
Recent results have established that there is a family of languages that is exactly the class of languages generated by three independently developed grammar formalisms: Tree Adjoining Grammars, Head Grammars, and Linear Indexed Grammars. In this paper we show that Combinatory Categorial Grammars also generates the same class of languages.
David J. Weir, Aravind K. Joshi
openaire +3 more sources
Generation of Two-Dimensional Grammar Based Pattern Languages using Array Rewriting P System
The theory of membrane computing was formulated by Paun as an attempt to formulate a computational model inspired by the way in which the living cells function. P systems which is a highly distributed, parallel, theoretical model and is an area of special interest in recent times.
Christopher Kezia Parimalam*+1 more
+5 more sources
HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changwook Kim, Tae Eui Jeong
+5 more sources
Rewriting the Grammar of the Education System: Delhi’s Education Reform (A Tale of Creative Resistance and Creative Disruption) [PDF]
The study was not designed to undertake an evaluation of the success or failure of reform. Nor was it specifically about the desirability or defects of the policy reform choices. It took these reform choices and the policy context as a given. It is important to note that the Delhi reforms had its share of criticisms (Kumar, 2016; Rampal, 2016). However,
Gokulnath Govindan+3 more
openaire +2 more sources
Understanding patchy landscape dynamics: towards a landscape language. [PDF]
Patchy landscapes driven by human decisions and/or natural forces are still a challenge to be understood and modelled. No attempt has been made up to now to describe them by a coherent framework and to formalize landscape changing rules.
Cédric Gaucherel+4 more
doaj +2 more sources
Formal modeling of autonomous dynamical systems: graph rewriting and grammar
Les systèmes distribués modernes à large-échelle évoluent dans des contextes variables soumis à de nombreux aléas auxquels ils doivent s'adapter dynamiquement. Dans ce cadre, l'informatique autonome se propose de réduire (voire supprimer) les interventions humaines lentes et coûteuse, en leur préférant l'auto-gestion.
Cédric Eichler
openaire +3 more sources