1000 search results - page 1 / 200 » Dependency Tree Automata |
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
CADE
2001
Springer
13 years 9 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
ACL
1996
13 years 6 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
CAV
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...