1246 search results - page 72 / 250 » Recursive Timed Automata |
119
Voted
SCN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
139
click to vote
IWPT
2001
15 years 2 months ago
2001
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
51
Voted
ACL
1998
15 years 2 months ago
1998
The paper presents a tabular interpretation for a kind of 2-Stack Automata. These automata may be used to describe various parsing strategies, ranging from purely top-down to pure...
102
click to vote
COCO
2000
Springer
15 years 4 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
109
Voted
IFL
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...