Sciweavers

555 search results - page 74 / 111
» Decompositions of Grammar Constraints
Sort
View
CCS
2005
ACM
14 years 2 months ago
Deciding security of protocols against off-line guessing attacks
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...
Mathieu Baudet
CLEF
2005
Springer
14 years 2 months ago
A Logic Programming Based Approach to QA@CLEF05 Track
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...
Paulo Quaresma, Irene Pimenta Rodrigues
VL
2000
IEEE
130views Visual Languages» more  VL 2000»
14 years 26 days ago
An OO Visual Language Definition Approach Supporting Multiple Views
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...
David H. Akehurst
DLT
2008
13 years 10 months ago
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
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...
Mohamed Faouzi Atig, Benedikt Bollig, Peter Haberm...
NAACL
2007
13 years 10 months ago
A Random Text Model for the Generation of Statistical Language Invariants
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 ...
Chris Biemann