Results 11 to 20 of about 439 (66)
Evolving stochastic context-free grammars for RNA secondary structure prediction [PDF]
BMC Bioinformatics, 2012 Wj Anderson J +4 more
core +2 more sources
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time [PDF]
, 2018 We present two structural results concerning the longest common prefixes of non-empty languages. First, we show that the longest common prefix of the language generated by a context-free grammar of size N equals the longest common prefix of the same ...
Luttenberger, Michael +2 more
core +2 more sources
Controlled Rewriting Using Productions and Reductions [PDF]
, 1988 We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. We distinguish several modes of derivation for this kind of grammar.
Hogendorp, Jan Anne
core +2 more sources
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
Generating All Permutations by Context-Free Grammars in Greibach Normal Form [PDF]
, 2007 We consider context-free grammars $G_n$ in Greibach normal form and, particularly, in Greibach $m$-form ($m=1,2$) which generates the finite language $L_n$ of all $n!$ strings that are permutations of $n$ different symbols ($n\geq 1$).
Asveld, P.R.J.
core +1 more source
Conversation Trees: A Grammar Model for Topic Structure in Forums [PDF]
, 2015 Online forum discussions proceed differently from face-to-face conversations and any single thread on an online forum contains posts on different subtopics.
Cohen, Shay B, Louis, Annie P
core +2 more sources
Compression of Rewriting Systems for Termination Analysis [PDF]
, 2013 We adapt the TreeRePair tree compression algorithm and use it as an intermediate step in proving termination of term rewriting systems. We introduce a cost function that approximates the size of constraint systems that specify compatibility of matrix ...
+3 more
core +1 more source
Ingeniare: Revista Chilena de Ingeniería, 2010 Es un hecho conocido que toda gramática libre de contexto puede ser transformada a la forma normal de Chomsky de tal forma que los lenguajes generados por las dos gramáticas son equivalentes.
Fredy Ángel Miguel Amaya Robayo +1 more
doaj
Parsing with CYK over Distributed Representations
, 2019 Syntactic parsing is a key task in natural language processing. This task has been dominated by symbolic, grammar-based parsers. Neural networks, with their distributed representations, are challenging these methods. In this article we show that existing
Cristini, Giordano +2 more
core +1 more source
Controlled Bidirectional Grammars [PDF]
, 1988 We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. We distinguish several modes of derivation for this kind of grammar.
Hogendorp, Jan Anne
core +1 more source