Results 1 to 10 of about 439 (66)
Computer Aided Verification32nd International Conference, 2020 Computer science class enrollments have rapidly risen in the past decade. With current class sizes, standard approaches to grading and providing personalized feedback are no longer possible and new techniques become both feasible and necessary.
D'Antoni, Loris +4 more
core +2 more sources
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Bernardy, Jean-Philippe, Jansson, Patrik
core +2 more sources
On the formalization of some results of context-free language theory [PDF]
, 2016 This work describes a formalization effort, using the Coq proof assistant, of fundamental results related to the classical theory of context-free grammars and languages.
Almeida, José Bacelar +3 more
core +1 more source
Enhancing the LR Parsing Strategy Using Incremental GPLR Parsing Method
مجلة علوم ذي قار, 2019 Parsers in modern integrated development environments (IDEs) for generalpurpose languages are virtually all of ad hoc, recursive descent variety. While such parsers have many disadvantages when compared with machine-generated LALR(1) parsers but they ...
Mouiad Abid Hani +1 more
doaj +4 more sources
Restricted Global Grammar Constraints [PDF]
, 2009 We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as hard as parsing ...
Katsirelos, George +3 more
core +3 more sources
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars [PDF]
, 2012 We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/\epsilon), where \epsilon > 0 is
Etessami, Kousha +2 more
core +2 more sources
Precise n-gram Probabilities from Stochastic Context-free Grammars [PDF]
, 1994 We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-grams (estimation from sparse data, lack of linguistic structure, among ...
Segal, Jonathan, Stolcke, Andreas
core +4 more sources
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems [PDF]
, 2012 Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds.
A. Finkel +16 more
core +3 more sources
Edit Distance for Pushdown Automata [PDF]
, 2017 The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$.
Chatterjee, Krishnendu +3 more
core +4 more sources
Parametrized Stochastic Grammars for RNA Secondary Structure Prediction
, 2007 We propose a two-level stochastic context-free grammar (SCFG) architecture for parametrized stochastic modeling of a family of RNA sequences, including their secondary structure.
Maier, Robert S.
core +2 more sources