Results 71 to 80 of about 459,830 (368)
Obtaining valuable clues for noncoding RNA (ribonucleic acid) subsequences remains a significant challenge, acknowledging that most of the human genome transcribes into noncoding RNA parts related to unknown biological operations.
Christos Andrikos+5 more
doaj +1 more source
Parikh's Theorem: A simple and direct automaton construction
Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular language. We present a very simple construction that, given a context-free
Aceto+18 more
core +1 more source
Probabilistic mathematical formula recognition using a 2D context-free graph grammar [PDF]
We present a probabilistic framework for the mathematical expression recognition problem. The developed system is flexible in that its grammar can be extended easily thanks to its graph grammar which eliminates the need for specifying rule precedence. It
Celik, Mehmet+3 more
core +3 more sources
Under environmental changes, the expression level of neuropeptide (NP) and neuropeptide receptor (NPR) genes changes to confer context‐dependent adaptation to the model organism Drosophila melanogaster. Through finding more regulatory elements in the NPR genes in comparison with their ligands (NPs), we found that NPR‐biased transcriptional regulation ...
SeungHeui Ryu+6 more
wiley +1 more source
On Intuitionistic Fuzzy Context-Free Languages
Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs).
Jianhua Jin, Qingguo Li, Chunquan Li
doaj +1 more source
Objective Gastrointestinal perforation (GIP) is a rare and life‐threatening safety concern associated with JAK inhibitors (JAKi). We aimed to review the evidence regarding the risk of GIP associated with the use of JAKi in patients with rheumatoid arthritis (RA) using a systematic review and network meta‐analysis approach.
Thipsukhon Sathapanasiri+7 more
wiley +1 more source
Controlled Rewriting Using Productions and Reductions [PDF]
We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. We distinguish several modes of derivation for this kind of grammar.
Hogendorp, Jan Anne
core +2 more sources
A universal context-free grammar
In this report we show that, for each alphabet Σ, there exists a context-free grammar G which satisfies the property that for each context-free language L ⊆ Σ* a regular control set C can be found such that LC(G) = L.
openaire +2 more sources
Thermoresponsive BrushGel Microcarriers for Efficient Cell Expansion and Enzyme‐Reduced Harvesting
Askari et al, report on temperature‐responsive microcarriers to minimize enzyme use and cost in dynamic cultures. Abstract Scaling up cell therapy requires efficient expansion of high‐quality cells. Microcarrier(MC)‐based systems offer high surface‐to‐volume ratios and reduce culture media usage.
Esfandyar Askari+9 more
wiley +1 more source
An Augmented Context Free Grammar for Discourse
This paper presents an augmented context free grammar which describes important features of the surface structure and the semantics of discourse in a formal way, integrating new as well as previously existing insights into a unified framework.
R. Scha, L. Polanyi
semanticscholar +1 more source