Results 31 to 40 of about 1,698 (255)
Path querying using conjunctive grammars
Graphs are used as a data structure to represent large volumes of information in a compact and convenient for analysis form in many areas: bioinformatics, graph databases, static code analysis, etc.
R. Sh. Azimov, S. V. Grigorev
doaj +1 more source
Generative Power and Closure Properties of Watson-Crick Grammars
We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties.
Nurul Liyana Mohamad Zulkufli +3 more
doaj +1 more source
On Restricted Context-Free Grammars
The contribution investigates the generative power of several derivation-restricted context-free grammars. Many derivation restriction mechanisms for context-free grammars have already been studied in the literature, and the current contribution investigates a restriction on the non-terminals that allows/disallows the application of a production ...
Dassow, J., Masopust, T. (Tomáš)
openaire +4 more sources
Lexicalized context-free grammars [PDF]
Lexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that can only generate context-free languages and can be parsed in cubic time.
Yves Schabes, Richard C. Waters
openaire +1 more source
On a property of probabilistic context-free grammars
It is proved that for a probabilistic context-free language L(G), the population density of a character (terminal symbol) is equal to its relative density in the words of a sample S from L(G) whenever the production probabilities of the grammar G are ...
R. Chaudhuri, A. N. V. Rao
doaj +1 more source
Equivalent Transformations and Regularization in Context-Free Grammars
Regularization of translational context-free grammar via equivalent transformations is a mandatory step in developing a reliable processor of a formal language defined by this grammar.
Fedorchenko Ludmila, Baranov Sergey
doaj +1 more source
Chomsky-Schützenberger parsing for weighted multiple context-free languages
We prove a Chomsky-Schützenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids. Using this representation we devise a parsing algorithm for a restricted form of those devices.
Tobias Denkinger
doaj +1 more source
Mass spectrometry based identification of AMP‐O‐Tris generated by Thermococcus onnurineus Cas10
Isolated Thermococcus onnurineus Cas10 generates the noncanonical ATP‐derived product AMP‐O‐Tris while in Tris‐containing buffer as identified via mass spectrometry, revealing relaxed nucleophile selectivity under isolated conditions. These findings suggest that multiprotein Csm complex assembly restricts Cas10 reactivity toward canonical cyclic ...
Su‐Jin Lee +6 more
wiley +1 more source
MINIMIZATION OF CONTEXT-FREE GRAMMARS
Summary: This paper solves the problem of transforming the initial context-free grammar (CF-grammar) without excess characters into equivalent CF-grammar with less complexity. To solve this problem, the following relation on the set of a CF-grammar non-terminals is introduced: \(E = \{(X,Y): (X=Y) \vee (X\to \alpha\Leftrightarrow Y\to \beta \wedge\vert
Ryazanov, Yu. D., Nazina, S. V.
openaire +2 more sources
Intercompartmental communication in senescence
Senescent cells experience structural changes in the plasma membrane, endoplasmic reticulum, mitochondria, lysosomes, nucleus, and cytoskeleton. These alterations disrupt crosstalk among cellular compartments, impairing vesicular trafficking, contact sites, and molecular flow.
Krystyna Mazan‐Mamczarz +3 more
wiley +1 more source

