Results 181 to 190 of about 1,304 (204)

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.
Ter Beek M H, CsuhajVarju E, Holzer M, Vaszil G   +3 more
openaire   +5 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.
E.G. Rajan, Y. Narasimha Rao, Yashaswi Vemuganti   +2 more
openaire   +3 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
openaire   +3 more sources

Teams in grammar systems: hybridity and weak rewriting

, 1996
Summary: Some new ideas in the theory of teams in grammar systems are introduced and studied. Traditionally, a team is formed from a finite number of sets of productions, and in every derivation step one production from each component is used to rewrite a symbol of the sentential form. Hence rewriting is done in parallel.
Maurice H. ter Beek
openaire   +4 more sources

On graph rewriting systems (Graph-Grammars)

, 2005
Manfred Nagl
openaire   +3 more sources

Bibliography on graph-rewriting systems (graph grammars)

Graph-Grammars and Their Application to Computer Science, 1982
Manfred Nagl
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Evolutionary Development of Growing Generic Sorting Networks by Means of Rewriting Systems

IEEE Transactions on Evolutionary Computation, 2020
This paper presents an evolutionary developmental method for the design of arbitrarily growing sorting networks. The developmental model is based on a parallel rewriting system (a grammar) that is specified by an alphabet, an initial string (an axiom ...
Michal Bidlo, M. Dobes
semanticscholar   +1 more source

Rewriting Systems and Grammars

openaire   +2 more sources

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

2023
This book seeks to illuminate the multifaceted challenges of introducing change and transition in low-capacity settings and documents the process of implementing an education reform in Delhi, India.
Admin, RISE, Aiyar, Yamini, Davis, Vincy, Govindan, Gokulnath, Kapoor, Taanya   +4 more
openaire   +1 more source

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
Catherine Meadows, José Meseguer, Santiago Escobar   +2 more
openaire   +2 more sources