43 search results - page 5 / 9 » Rigid tree automata and applications |
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
TCS
2002
13 years 7 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
JAPLL
2010
13 years 6 months ago
2010
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
CA
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a simple method for performing real-time collision detection in a virtual surgery environment. The method relies on the graphics hardware for testing the interpenetrati...