Results 141 to 150 of about 10,037 (171)
Some of the next articles are maybe not open access.
Array P systems and pure 2D context-free grammars with independent mode of rewriting
Journal of Membrane Computing, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Somnath Bera +3 more
openaire +1 more source
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 +1 more source
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 +1 more source
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 +4 more
openaire +1 more source
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 +4 more
openaire +1 more source
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
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
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
Array-Rewriting P Systems with Basic Puzzle Grammar Rules and Permitting Features
2017Motivated 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 +1 more source
On relating rewriting systems and graph grammars to event structures
1994In 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 +1 more source
Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems
2010Multiple 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 ...
openaire +1 more source
Teams in grammar systems: hybridity and weak rewriting
1996Summary: 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.
openaire +4 more sources
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly