877 search results - page 51 / 176 » How to Cover a Grammar |
EJC
2007
15 years 17 days ago
2007
In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to...
123
click to vote
TCBB
2011
14 years 7 months ago
2011
Stochastic models such as hidden Markov models or stochastic context free grammars can fail to return the correct, maximum likelihood solution in the case of semantic ambiguity. T...
228
click to vote
Book
"Java Gently teaches the reader how to program and how to do it in the best possible style in Java. In the process, it details the fundamental structures of the Java 2 languag...
90
Voted
SE
2007
15 years 2 months ago
2007
: This paper is a tutorial on the principles and applications of static tion by Abstract Interpretation to development, verification and validation ded applications. The topics cov...
113
Voted
APLAS
2003
ACM
15 years 4 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...