555 search results - page 74 / 111 » Decompositions of Grammar Constraints |
105
Voted
CCS
2005
ACM
15 years 6 months ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
109
Voted
CLEF
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
123
Voted
VL
2000
IEEE
15 years 5 months ago
2000
IEEE
The formal approach to visual language definition is to use graph grammars and/or graph transformation techniques. These techniques focus on specifying the syntax and manipulation...
DLT
2008
15 years 2 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
NAACL
2007
15 years 2 months ago
2007
A novel random text generation model is introduced. Unlike in previous random text models, that mainly aim at producing a Zipfian distribution of word frequencies, our model also ...