Sciweavers

102 search results - page 8 / 21
» Tile Rewriting Grammars
Sort
View
FOSSACS
2006
Springer
13 years 10 months ago
Processes for Adhesive Rewriting Systems
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
Paolo Baldan, Andrea Corradini, Tobias Heindel, Ba...
EMNLP
2004
13 years 8 months ago
Automatic Analysis of Plot for Story Rewriting
A method for automatic plot analysis of narrative texts that uses components of both traditional symbolic analysis of natural language and statistical machine-learning is presente...
Harry Halpin, Johanna D. Moore, Judy Robertson
CCS
2005
ACM
14 years 8 days 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
IWPC
2003
IEEE
14 years 3 hour ago
How Understanding and Restructuring Differ from Compiling - A Rewriting Perspective
Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems rev...
Paul Klint
ACL
2010
13 years 4 months ago
Optimal Rank Reduction for Linear Context-Free Rewriting Systems with Fan-Out Two
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
Benoît Sagot, Giorgio Satta