Results 11 to 20 of about 1,698 (255)
Implicit learning of recursive context-free grammars. [PDF]
PLoS ONE, 2012 Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed
Martin Rohrmeier +2 more
doaj +2 more sources
Estimating probabilistic context-free grammars for proteins using contact map constraints [PDF]
PeerJ, 2019 Interactions between amino acids that are close in the spatial structure, but not necessarily in the sequence, play important structural and functional roles in proteins.
Witold Dyrka +3 more
doaj +3 more sources
Multithreaded comparative RNA secondary structure prediction using stochastic context-free grammars [PDF]
BMC Bioinformatics, 2011 Background The prediction of the structure of large RNAs remains a particular challenge in bioinformatics, due to the computational complexity and low levels of accuracy of state-of-the-art algorithms.
Værum Morten +4 more
doaj +2 more sources
Learning of Structurally Unambiguous Probabilistic Grammars [PDF]
Logical Methods in Computer Science, 2023 The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule.
Dana Fisman +2 more
doaj +1 more source
On Elimination of Erasing Rules from E0S Grammars [PDF]
Computer Science Journal of Moldova, 2022 The present paper describes an alternative algorithm for the removal of erasing rules from E0S grammars. As opposed to the standard way of eliminating erasing rules in most E0S-like grammars, such as context-free grammars, this method requires no ...
Alexander Meduna, Martin Havel
doaj +1 more source
Grammar-Based Specification and Parsing of Binary File Formats
International Journal of Digital Curation, 2012 The capability to validate and view or play binary file formats, as well as to convert binary file formats to standard or current file formats, is critically important to the preservation of digital data and records. This paper describes the extension of
William Underwood
doaj +11 more sources
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics [PDF]
Logical Methods in Computer Science, 2023 The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive
Jos C. M. Baeten +2 more
doaj +1 more source
A Framework for Rewriting Families of String Diagrams [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context-free families of string diagrams which we represent using context-free ...
Vladimir Zamdzhiev
doaj +1 more source
Context-Free Grammars for Several Triangular Arrays
Axioms, 2022 In this paper, we present a unified grammatical interpretation of the numbers that satisfy a kind of four-term recurrence relation, including the Bell triangle, the coefficients of modified Hermite polynomials, and the Bessel polynomials.
Roberta Rui Zhou, Jean Yeh, Fuquan Ren
doaj +1 more source
Complexity of Problems of Commutative Grammars [PDF]
Logical Methods in Computer Science, 2015 We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an assumption that the ...
Eryk Kopczynski
doaj +1 more source