Results 171 to 180 of about 242 (196)
Some of the next articles are maybe not open access.
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
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
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
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
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
Teams in grammar systems: hybridity and weak rewriting
Acta Cybern., 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
Tile rewriting grammars and picture languages
Theoretical Computer Science, 2005Stefano Crespi Reghizzi +1 more
exaly