2492 search results - page 95 / 499 » On the General Signature Trees |
197
click to vote
FSMNLP
2009
Springer
15 years 3 months ago
2009
Springer
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
176
Voted
ASIACRYPT
2001
Springer
15 years 9 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
181
click to vote
AGTIVE
2003
Springer
15 years 10 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
169
click to vote
STOC
2010
ACM
16 years 2 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
150
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...