Results 201 to 210 of about 9,952 (218)
Array P systems and pure 2D context-free grammars with independent mode of rewriting
Journal of Membrane Computing, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Somnath Bera +3 more
openalex +2 more sources
Graph grammars as context-dependent rewriting systems: A partial ordering semantics
, 1992 Context-dependent rewriting systems allow a higher degree of concurrency w.r.t. context-independent ones, since rewriting rules which apply in intersecting contexts and rewrite different items may be applied concurrently, while this cannot happen with a context-independent specification of the same rules. Context-dependent systems can also be seen as a
Ugo Montanari, Francesca Rossi
openalex +3 more sources
End Justified Post Turing Rewriting Systems and M-Grammar
2012 International Conference on Computing Sciences, 2012 This paper deals with the formulation of a non-Chosky grammar called M-grammar which defines the language of End Justified Post Turing Rewriting Systems. Formulation of this grammar has solved the Problem of Generating Markov Class Rewriting Systems By a Type-0 Phrase Structure Grammar.
Yamarthi Narasimha Rao +2 more
openalex +2 more sources
, 2005 Relational growth grammars (RGG) area graph rewriting formalism which extends the notations and semantics of Lindenmayer systems and which allows the specification of dynamical processes on dynamical structures, parti cular ly in biological and chemical applications.
Winfried Kurth +2 more
openalex +2 more sources
Array-Rewriting P Systems with Basic Puzzle Grammar Rules and Permitting Features
, 2017 Motivated by the problem of tiling the plane, puzzle grammars were introduced as a mechanism for generating languages of picture arrays in the two-dimensional plane. On the other hand BPG array P system with array objects and basic puzzle grammar (BPG) rules was introduced as a variant of array generating P systems that were developed with a view to ...
Pradeep Isawasan +3 more
openalex +2 more sources
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
, 2008 It is well known that certain language families generated by cooperating distributed (CD) grammar systems can be characterized in terms of context-free random context grammars. In particular, the language families generated by CD grammar systems working in the t- and -modes of derivation obey a characterization in terms of ET0L systems, or equivalently
Henning Bordihn, Markus Holzer
openalex +2 more sources
On relating rewriting systems and graph grammars to event structures
, 1994 In this paper, we investigate how rewriting systems and especially graph grammars as operational models of parallel and distributed systems can be related to event structures as more abstract models. First, distributed rewriting systems that are based on the notion of contexts are introduced as a common framework for different kinds of rewriting ...
Georg Schied
openalex +2 more sources
Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems
, 2010 Multiple Context-Free Grammars (MCFGs) have been introduced by Seki et al. (1991) while the equivalent Linear Context-Free Rewriting Systems (LCFRSs) were independently proposed by Vijay-Shanker, Weir, and Joshi (1987). The central idea is to extend CFGs such that non-terminal symbols can span a tuple of strings that need not be adjacent in the input ...
Laura Kallmeyer
openalex +2 more sources