Results 201 to 210 of about 557 (235)

CHARGE Syndrome: What an Otolaryngologist Should Know—A Systematic Review and Meta‐Analysis

Otolaryngology–Head and Neck Surgery, EarlyView.
Abstract Objective To synthesize the prevalence of otolaryngologic manifestations in CHARGE syndrome (CS) to support otolaryngologists in delivering comprehensive management. Data Sources PubMed/MEDLINE, Embase, and Google Scholar were searched for English‐ and French‐language studies published from January 1980 through January 2025.
Camille Caron, Massil Badji, Camille Prigent, Alix Pincivy, Erika Mercier, Mathieu Bergeron   +5 more
wiley   +1 more source

Pebble macro tree transducers with strong pebble handling [PDF]

, 2011
Muzamel Loránd
core  

scMetaTraj: A Metabolism‐Centered Framework for Trajectory Inference in Single‐Cell Data

Med Research, EarlyView.
Jinwei Dai, Zhihong Zuo, Xiaoyang Pang, Lixin Ke, Lina Zhang, Zhaoxin Qian   +5 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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, Rodica Ceterchi, Sastha Sriram, K. G. Subramanian 0001   +3 more
openaire   +3 more sources

On relating rewriting systems and graph grammars to event structures

Lecture Notes in Computer Science, 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 ...
openaire   +3 more sources

Relational Growth Grammars – A Graph Rewriting Approach to Dynamical Systems with a Dynamical Structure

Lecture Notes in Computer Science, 2005
Relational growth grammars (RGG) area graph rewriting formalism which extends the notations and semantics of Lindenmayer systems and which allows the specification of dynamical processes on dynamical structures, parti cular ly in biological and chemical applications.
Winfried Kurth, Ole Kniemeyer, Gerhard H. Buck-Sorlin   +2 more
openaire   +3 more sources

Multiple Context-Free Grammars and Linear Context-Free Rewriting Systems

Cognitive Technologies, 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, Kallmeyer Laura
openaire   +3 more sources

On graph rewriting systems (Graph-Grammars)

2005
Nagl M
openaire   +3 more sources

Handle-rewriting hypergraph grammars [PDF]

Journal of Computer and System Sciences, 1993
We introduce the handle-rewriting hypergraph grammars (HH grammars), based on the replacement of handles, i.e., of subhypergraphs consisting of one hyperedge together with its incident vertices.
Bruno Courcelle, Grzegorz Rozenberg, Joost Engelfriet   +2 more
exaly   +2 more sources

Tile rewriting grammars and picture languages [PDF]

Theoretical Computer Science, 2005
Tile Rewriting Grammars (TRG) are a new model for defining picture languages. A rewriting rule changes a homogeneous rectangular subpicture into a isometric one tiled with specified tiles.
Matteo Pradella, Stefano Crespi Reghizzi   +1 more
exaly   +2 more sources