Results 211 to 220 of about 557 (235)
Graph grammars with string-regulated rewriting [PDF]
Theoretical Computer Science, 2011 Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to have
Jürgen Dassow +2 more
exaly +4 more sources
Rewriting P systems: improved hierarchies [PDF]
Theoretical Computer Science, 2005 Generally, for proving universality results about rewriting P systems one considers matrix grammars in the strong binary normal form. Such grammars contain both matrices with rules used in the appearance checking mode and matrices without appearance ...
Madhu Mutyam
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ON COMPETENCE IN CD GRAMMAR SYSTEMS WITH PARALLEL REWRITING
International Journal of Foundations of Computer Science, 2007We 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 +3 more sources
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
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
End Justified Post Turing Rewriting Systems and M-Grammar
2012 International Conference on Computing Sciences, 2012This 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.
Y. Narasimha Rao +2 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, 2005The 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 +1 more source
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
2008It 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
Graph grammars as context-dependent rewriting systems: A partial ordering semantics
1992Context-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 +2 more sources
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms [PDF]
Journal of Logic, Language and Information, 2004 http://www.springerlink.com/content/1572-9583/We show how to encode context-free string grammars, linear context-free tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars.
Philippe De Groote +2 more
exaly +3 more sources