Results 41 to 50 of about 176,605 (340)
On Restricted Context-Free Grammars
Journal of Computer and System Sciences, 2010 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
Multiplicative-Additive Focusing for Parsing as Deduction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Spurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing.
Glyn Morrill, Oriol Valentín
doaj +1 more source
An Augmented Context Free Grammar for Discourse
International Conference on Computational Linguistics, 1988 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
Lexicalized context-free grammars [PDF]
Proceedings of the 31st annual meeting on Association for Computational Linguistics -, 1993 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
A Password Cracking Method Based on Name Initials Shorthand Structure [PDF]
Jisuanji gongcheng, 2017 User password guess research is one of the important parts of password security research.According to the relationship between user’s personal information and user password,analyzes the structural characteristics of the user’s personal information ...
LUO Min,ZHANG Yang
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
The role of histone modifications in transcription regulation upon DNA damage
FEBS Letters, EarlyView.This review discusses the critical role of histone modifications in regulating gene expression during the DNA damage response (DDR). By modulating chromatin structure and recruiting repair factors, these post‐translational modifications fine‐tune transcriptional programmes to maintain genomic stability.
Angelina Job Kolady, Siyao Wang
wiley +1 more source
MINIMIZATION OF CONTEXT-FREE GRAMMARS
Prikladnaya Diskretnaya Matematika, 2019 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
Modeling hepatic fibrosis in TP53 knockout iPSC‐derived human liver organoids
Molecular Oncology, EarlyView.This study developed iPSC‐derived human liver organoids with TP53 gene knockout to model human liver fibrosis. These organoids showed elevated myofibroblast activation, early disease markers, and advanced fibrotic hallmarks. The use of profibrotic differentiation medium further amplified the fibrotic signature seen in the organoids.
Mustafa Karabicici +8 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