Results 1 to 10 of about 318,571 (237)
LPG–PCFG: An Improved Probabilistic Context- Free Grammar to Hit Low-Probability Passwords [PDF]
Sensors, 2022 With the development of the Internet, information security has attracted more attention. Identity authentication based on password authentication is the first line of defense; however, the password-generation model is widely used in offline password ...
Xiaozhou Guo +4 more
doaj +4 more sources
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 +6 more sources
Learning Cover Context-Free Grammars from Structural Data [PDF]
Scientific Annals of Computer Science, 2014 We consider the problem of learning an unknown context-free gram- mar from its structural descriptions with depth at most ℓ. The structural descriptions of the context-free grammar are its unlabelled derivation trees. The goal is to learn a cover context-
M. Marin, G. Istrate
doaj +4 more sources
A stochastic context free grammar based framework for analysis of protein sequences [PDF]
BMC Bioinformatics, 2009 Background In the last decade, there have been many applications of formal language theory in bioinformatics such as RNA structure prediction and detection of patterns in DNA.
Nebel Jean-Christophe, Dyrka Witold
doaj +2 more sources
Subgraph Queries by Context-free Grammars [PDF]
Journal of Integrative Bioinformatics, 2008 SummaryWe describe a method for querying vertex- and edge-labeled graphs using context-free grammars to specify the class of interesting paths. We introduce a novel problem, finding the connection subgraph induced by the set of matching paths between given two vertices or two sets of vertices.
Petteri Sevón, Lauri Eronen
+6 more sources
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
Acta Cybernetica, 2015 Jungles generalize trees by sharing subtrees and allowing garbage. It is shown that IO context-free tree grammars generate the same jungle languages as context-free jungle grammars.
Frank Drewes, Joost Engelfriet
openalex +5 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 +4 more sources
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components.
Erzsébet Csuhaj-Varjú, György Vaszil
doaj +6 more sources
Cross-Domain Feature Enhancement-Based Password Guessing Method for Small Samples [PDF]
EntropyAs a crucial component of account protection system evaluation and intrusion detection, the advancement of password guessing technology encounters challenges due to its reliance on password data. In password guessing research, there is a conflict between
Cheng Liu +7 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