Sciweavers

186 search results - page 32 / 38
» Grammar constraints
Sort
View
AHS
2007
IEEE
253views Hardware» more  AHS 2007»
14 years 1 months ago
evolFIR: Evolving redundancy-free FIR structures
Finite impulse response (FIR) structures are the most commonly used digital filters and can be found in various areas of everyday life. In this paper we introduce a novel approac...
Szilvia Zvada, Gabriella Kókai, Róbe...
CCS
2005
ACM
14 years 27 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
VL
2000
IEEE
130views Visual Languages» more  VL 2000»
13 years 11 months 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 8 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 8 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