Results 41 to 50 of about 304,382 (268)
Superregular grammars do not provide additional explanatory power but allow for a compact analysis of animal song [PDF]
Royal Society Open Science, 2019 A pervasive belief with regard to the differences between human language and animal vocal sequences (song) is that they belong to different classes of computational complexity, with animal song belonging to regular languages, whereas human language is ...
T. Morita, H. Koda
doaj +1 more source
Syntactic Pattern Recognition for the Prediction of L-Type Pseudoknots in RNA
Applied Sciences, 2023 The observation and analysis of RNA molecules have proved crucial for the understanding of various processes in nature. Scientists have mined knowledge and drawn conclusions using experimental methods for decades.
Christos Koroulis +4 more
doaj +1 more source
Inductive Synthesis of Cover-Grammars with the Help of Ant Colony Optimization
Foundations of Computing and Decision Sciences, 2016 A cover-grammar of a finite language is a context-free grammar that accepts all words in the language and possibly other words that are longer than any word in the language.
Wieczorek Wojciech
doaj +1 more source
Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications [PDF]
, 2012 This paper introduces the notion of a new transducer as a two-component system, which consists of a nite automaton and a context-free grammar. In essence, while the automaton reads its input string, the grammar produces its output string, and their ...
Horáček, Petr +2 more
core +1 more source
Weighted omega-Restricted One Counter Automata [PDF]
Logical Methods in Computer Science, 2018 Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a ...
Manfred Droste, Werner Kuich
doaj +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
Probabilistic mathematical formula recognition using a 2D context-free graph grammar [PDF]
, 2011 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
Arthritis Care &Research, EarlyView.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
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