Results 51 to 60 of about 318,670 (335)
On Intuitionistic Fuzzy Context-Free Languages
Journal of Applied Mathematics, 2013 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
Analyzing Ambiguity of Context-Free Grammars [PDF]
BRICS Report Series, 2006 <p>It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures.
Brabrand, Claus +4 more
openaire +7 more sources
Binary Context-Free Grammars [PDF]
Symmetry, 2020 A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a set of pairs of productions and the pair of the initial nonterminals that generates the binary relation, i.e., the set of pairs of strings over the terminal alphabets.
Sherzod Turaev +4 more
openaire +1 more source
FEBS Open Bio, EarlyView.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
Methods and Protocols, 2022 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
, 2011 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
New Directions for Adult and Continuing Education, EarlyView.ABSTRACT This article explores how artificial intelligence (AI) is reshaping scholarly research and writing for faculty in higher education. As AI becomes increasingly integrated into academic workflows, it offers opportunities to enhance efficiency, exchange ideas, and foster creativity, while also raising critical questions about authorship ...
Adam L. McClain, Scott Barton
wiley +1 more source
Evaluating two methods for Treebank grammar compaction [PDF]
, 1999 Treebanks, such as the Penn Treebank, provide a basis for the automatic creation of broad coverage grammars. In the simplest case, rules can simply be ‘read off’ the parse-annotations of the corpus, producing either a simple or probabilistic context-free
Gaizauskas, R. +3 more
core +1 more source
Advanced Functional Materials, EarlyView.This study introduces a novel multi‐scale scaffold design using L‐fractals arranged in Archimedean tessellations for tissue regeneration. Despite similar porosity, tiles display vastly different tensile responses (1–100 MPa) and deformation modes. In vitro experiments with hMSCs show geometry‐dependent growth and activity. Over 55 000 tile combinations
Maria Kalogeropoulou +4 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Advances in integrating artificial intelligence into 3D bioprinting are systematically reviewed here. Machine learning, computer vision, robotics, natural language processing, and expert systems are examined for their roles in optimizing bioprinting parameters, real‐time monitoring, quality control, and predictive maintenance.
Joao Vitor Silva Robazzi +10 more
wiley +1 more source