Results 201 to 210 of about 700 (231)
Some of the next articles are maybe not open access.

Graph grammars as context-dependent rewriting systems: A partial ordering semantics

Lecture Notes in Computer Science, 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
U. Montanari, ROSSI, FRANCESCA
openaire   +5 more sources

On relating rewriting systems and graph grammars to event structures

Lecture Notes in Computer Science, 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 ...
openaire   +3 more sources

Relational Growth Grammars – A Graph Rewriting Approach to Dynamical Systems with a Dynamical Structure

Lecture Notes in Computer Science, 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
openaire   +3 more sources

ON COMPETENCE IN CD GRAMMAR SYSTEMS WITH PARALLEL REWRITING

International Journal of Foundations of Computer Science, 2007
We continue our investigation of the generative power of cooperating distributed grammar systems (CDGSs), using the previously introduced ≤k-, =k-, and ≥k-competence-based cooperation strategies and context-free components that rewrite the sentential form in a parallel manner.
Maurice H. ter Beek   +3 more
openaire   +4 more sources

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
openaire   +1 more source

Rewriting the Grammar of the Education System: Delhi’s Education Reform (A Tale of Creative Resistance and Creative Disruption)

2021
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,
Yamini Aiyar   +3 more
openaire   +2 more sources

A rewriting-based inference system for the NRL protocol analyzer

Proceedings of the 2005 ACM workshop on Formal methods in security engineering, 2005
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-life protocols. It probably outranks any of the existing tools in the sheer range of the types of attacks it is able to model and discover. However, the techniques in NPA lack an
Santiago Escobar 0001   +2 more
openaire   +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 0001
openaire   +1 more source

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
openaire   +2 more sources

The Graph Isomorphism Problem and the GI-Completeness of Selected Problems from Context-Free Grammars and Rewrite Systems

2021
Graph isomorphisms are adjacency and label (equivalence class) preserving one-to-one correspondences between vertex sets of possibly labelled graphs. The graph isomorphism problem is then the task of deciding whether two given graphs are isomorphic or not and basis of complexity class GI, containing all problems with polynomial reduction to former ...
openaire   +1 more source

Home - About - Disclaimer - Privacy