Results 161 to 170 of about 228 (183)
Learning Styles, Engagement and Anxiety in AI‐Mediated Writing: A Multimodal Feedback Study
International Journal of Applied Linguistics, EarlyView.ABSTRACT Artificial intelligence (AI) tools now permeate English academic writing. However, evidence on how feedback modalities align with student differences and with psychological mechanisms remains limited. Prior work often reduced learning styles to simple matches with delivery modes and treated learning engagement and writing anxiety as peripheral.
Yi Ren +3 more
wiley +1 more source
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 +2 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.
Y. Narasimha Rao +2 more
openaire +2 more sources
Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems
, 2010 Multiple 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 ...
Laura Kallmeyer
openaire +2 more sources
On relating rewriting systems and graph grammars to event structures
, 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 ...
Georg Schied
openaire +2 more sources
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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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