Results 21 to 30 of about 672 (226)
An earley parsing algorithm for range concatenation grammars [PDF]
, 2009 We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley parser is that we use a technique of range boundary constraint propagation to ...
Yannick Parmentier +5 more
core +1 more source
Grammars and cellular automata for evolving neural networks architectures [PDF]
, 2000 IEEE International Conference on Systems, Man, and Cybernetics. Nashville, TN, 8-11 October 2000The class of feedforward neural networks trained with back-propagation admits a large variety of specific architectures applicable to approximation pattern ...
Molina López, José Manuel +3 more
core +1 more source
Ten virtues of structured graphs [PDF]
, 2009 This paper extends the invited talk by the first author about the virtues of structured graphs. The motivation behind the talk and this paper relies on our experience on the development of ADR, a formal approach for the design of styleconformant ...
Lluch-Lafuente, Alberto +3 more
core +1 more source
Generation of Two-Dimensional Grammar Based Pattern Languages using Array Rewriting P System
International Journal of Innovative Technology and Exploring Engineering, 2019 The theory of membrane computing was formulated by Paun as an attempt to formulate a computational model inspired by the way in which the living cells function. P systems which is a highly distributed, parallel, theoretical model and is an area of special interest in recent times.
Christopher Kezia Parimalam* +1 more
openaire +2 more sources
Accepting grammars and systems [PDF]
, 2007 We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited ...
Bordihn, Henning, Fernau, Henning
core +1 more source
A polynomial-time parsing algorithm for TT-MCTAG [PDF]
, 2009 This paper investigates the class of Tree-Tuple MCTAG with Shared Nodes, TT-MCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language processing, in particular for dealing with discontinuities and word order ...
KALLMEYER L +4 more
core +1 more source
Rewriting P systems: improved hierarchies [PDF]
, 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 ...
Mutyam, Madhu
core +1 more source
Molecular Oncology, EarlyView.LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang +9 more
wiley +1 more source
A study in parallel rewriting systems [PDF]
, 1980 In this paper we study systematically three basic classes of grammars incorporating parallel rewriting: Indian parallel grammars, Russian parallel grammars and L systems.
G. Rozenberg +3 more
core +1 more source
Pathways and pitfalls: a qualitative study of student experiences in biomedical science education
FEBS Open Bio, EarlyView.Biomedical science students from underrepresented backgrounds face barriers including financial strain, disrupted laboratory access and cultural exclusion. Peer networks provide vital support when institutional systems are difficult to navigate. To create inclusive learning environments and achieve academic success, educators should blend active, hands‐
Olivia J. Russell +8 more
wiley +1 more source